./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 19:05:56,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:05:56,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:05:56,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:05:56,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:05:56,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:05:57,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:05:57,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:05:57,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:05:57,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:05:57,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:05:57,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:05:57,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:05:57,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:05:57,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:05:57,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:05:57,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:05:57,003 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/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-03-08 19:05:57,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:05:57,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:05:57,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:05:57,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:05:57,253 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:05:57,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-08 19:05:58,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1d566d9/8fe2674cec954700835b5100906804ac/FLAG620c7ff06 [2025-03-08 19:05:58,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:05:58,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-08 19:05:58,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1d566d9/8fe2674cec954700835b5100906804ac/FLAG620c7ff06 [2025-03-08 19:05:58,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1d566d9/8fe2674cec954700835b5100906804ac [2025-03-08 19:05:58,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:05:58,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:05:58,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:05:58,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:05:58,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:05:58,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:05:58" (1/1) ... [2025-03-08 19:05:58,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae6b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:58, skipping insertion in model container [2025-03-08 19:05:58,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:05:58" (1/1) ... [2025-03-08 19:05:59,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:05:59,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-08 19:05:59,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:05:59,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:05:59,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-08 19:05:59,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:05:59,592 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:05:59,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59 WrapperNode [2025-03-08 19:05:59,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:05:59,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:05:59,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:05:59,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:05:59,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,690 INFO L138 Inliner]: procedures = 100, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 802 [2025-03-08 19:05:59,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:05:59,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:05:59,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:05:59,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:05:59,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,757 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 14, 65, 32, 103]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 0, 0, 10]. The 204 writes are split as follows [0, 12, 2, 65, 32, 93]. [2025-03-08 19:05:59,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:05:59,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:05:59,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:05:59,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:05:59,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (1/1) ... [2025-03-08 19:05:59,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:05:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:05:59,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:05:59,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:05:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-03-08 19:05:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:05:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:05:59,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:05:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:05:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:05:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-03-08 19:05:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-08 19:05:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-03-08 19:05:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-08 19:05:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 19:05:59,874 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:05:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-08 19:05:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:05:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:05:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:05:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:06:00,089 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:06:00,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:06:00,147 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet118; [2025-03-08 19:06:00,181 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret117.base, #t~ret117.offset; [2025-03-08 19:06:00,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet105; [2025-03-08 19:06:05,171 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2025-03-08 19:06:05,172 INFO L1307 $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-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet119#1; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret120#1.base, regulator_register_#t~ret120#1.offset; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet113#1; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret110#1.base, dev_get_drvdata_#t~ret110#1.offset; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet114#1; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet111#1; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet115#1; [2025-03-08 19:06:05,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret112#1.base, devm_kzalloc_#t~ret112#1.offset; [2025-03-08 19:06:05,270 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2025-03-08 19:06:05,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:06:05,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:06:05,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:06:05,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:06:05 BoogieIcfgContainer [2025-03-08 19:06:05,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:06:05,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:06:05,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:06:05,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:06:05,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:05:58" (1/3) ... [2025-03-08 19:06:05,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef7bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:06:05, skipping insertion in model container [2025-03-08 19:06:05,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:05:59" (2/3) ... [2025-03-08 19:06:05,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef7bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:06:05, skipping insertion in model container [2025-03-08 19:06:05,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:06:05" (3/3) ... [2025-03-08 19:06:05,303 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-08 19:06:05,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:06:05,318 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-03-08 19:06:05,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:06:05,380 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;@492f7223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:06:05,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:06:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 144 states have (on average 1.375) internal successors, (198), 152 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-03-08 19:06:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 19:06:05,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:05,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:06:05,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:05,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash -915725536, now seen corresponding path program 1 times [2025-03-08 19:06:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247500675] [2025-03-08 19:06:05,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:07,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 19:06:07,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 19:06:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247500675] [2025-03-08 19:06:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247500675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:08,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922516721] [2025-03-08 19:06:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:08,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:08,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:08,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:08,286 INFO L87 Difference]: Start difference. First operand has 186 states, 144 states have (on average 1.375) internal successors, (198), 152 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-03-08 19:06:12,331 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-03-08 19:06:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:12,880 INFO L93 Difference]: Finished difference Result 530 states and 754 transitions. [2025-03-08 19:06:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:12,882 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-03-08 19:06:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:12,892 INFO L225 Difference]: With dead ends: 530 [2025-03-08 19:06:12,892 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 19:06:12,895 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-03-08 19:06:12,896 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 19:06:12,898 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.5s Time] [2025-03-08 19:06:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 19:06:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2025-03-08 19:06:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.3571428571428572) internal successors, (361), 273 states have internal predecessors, (361), 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-03-08 19:06:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 459 transitions. [2025-03-08 19:06:12,953 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 459 transitions. Word has length 15 [2025-03-08 19:06:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 459 transitions. [2025-03-08 19:06:12,955 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-03-08 19:06:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 459 transitions. [2025-03-08 19:06:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 19:06:12,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:12,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:06:12,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:06:12,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -645547843, now seen corresponding path program 1 times [2025-03-08 19:06:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682160465] [2025-03-08 19:06:12,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:14,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 19:06:14,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 19:06:14,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:14,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682160465] [2025-03-08 19:06:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682160465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:14,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219604340] [2025-03-08 19:06:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:14,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:14,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:14,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:14,903 INFO L87 Difference]: Start difference. First operand 339 states and 459 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-03-08 19:06:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:15,015 INFO L93 Difference]: Finished difference Result 361 states and 485 transitions. [2025-03-08 19:06:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:15,016 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-03-08 19:06:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:15,019 INFO L225 Difference]: With dead ends: 361 [2025-03-08 19:06:15,021 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 19:06:15,021 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-03-08 19:06:15,022 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 238 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 267 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-03-08 19:06:15,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 267 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:06:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 19:06:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2025-03-08 19:06:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.3533834586466165) internal successors, (360), 273 states have internal predecessors, (360), 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-03-08 19:06:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 458 transitions. [2025-03-08 19:06:15,057 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 458 transitions. Word has length 18 [2025-03-08 19:06:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 458 transitions. [2025-03-08 19:06:15,057 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-03-08 19:06:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 458 transitions. [2025-03-08 19:06:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 19:06:15,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:15,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:06:15,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:06:15,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:15,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash -616918692, now seen corresponding path program 1 times [2025-03-08 19:06:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131668054] [2025-03-08 19:06:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:16,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 19:06:16,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 19:06:16,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:16,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131668054] [2025-03-08 19:06:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131668054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:16,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:16,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557839355] [2025-03-08 19:06:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:16,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:16,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:16,947 INFO L87 Difference]: Start difference. First operand 339 states and 458 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-03-08 19:06:20,976 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-03-08 19:06:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:21,382 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2025-03-08 19:06:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:21,383 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-03-08 19:06:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:21,387 INFO L225 Difference]: With dead ends: 341 [2025-03-08 19:06:21,387 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 19:06:21,387 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-03-08 19:06:21,388 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 239 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:06:21,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 239 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 19:06:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 19:06:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-08 19:06:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.349624060150376) internal successors, (359), 272 states have internal predecessors, (359), 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-03-08 19:06:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 456 transitions. [2025-03-08 19:06:21,413 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 456 transitions. Word has length 18 [2025-03-08 19:06:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 456 transitions. [2025-03-08 19:06:21,415 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-03-08 19:06:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 456 transitions. [2025-03-08 19:06:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 19:06:21,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:21,417 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-03-08 19:06:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:06:21,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1944915556, now seen corresponding path program 1 times [2025-03-08 19:06:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809584532] [2025-03-08 19:06:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 19:06:23,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 19:06:23,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:23,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809584532] [2025-03-08 19:06:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809584532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496033602] [2025-03-08 19:06:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:23,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:23,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:23,331 INFO L87 Difference]: Start difference. First operand 338 states and 456 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-03-08 19:06:27,362 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-03-08 19:06:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:27,796 INFO L93 Difference]: Finished difference Result 340 states and 457 transitions. [2025-03-08 19:06:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:27,798 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-03-08 19:06:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:27,800 INFO L225 Difference]: With dead ends: 340 [2025-03-08 19:06:27,800 INFO L226 Difference]: Without dead ends: 337 [2025-03-08 19:06:27,801 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-03-08 19:06:27,803 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 237 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-03-08 19:06:27,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 237 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 19:06:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-08 19:06:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-08 19:06:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.3458646616541354) internal successors, (358), 271 states have internal predecessors, (358), 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-03-08 19:06:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 454 transitions. [2025-03-08 19:06:27,823 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 454 transitions. Word has length 19 [2025-03-08 19:06:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 454 transitions. [2025-03-08 19:06:27,825 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-03-08 19:06:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 454 transitions. [2025-03-08 19:06:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 19:06:27,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:27,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] [2025-03-08 19:06:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:06:27,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -163146403, now seen corresponding path program 1 times [2025-03-08 19:06:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808254027] [2025-03-08 19:06:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 19:06:29,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 19:06:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808254027] [2025-03-08 19:06:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808254027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:29,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399271420] [2025-03-08 19:06:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:29,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:29,572 INFO L87 Difference]: Start difference. First operand 337 states and 454 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-03-08 19:06:33,600 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-03-08 19:06:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:34,084 INFO L93 Difference]: Finished difference Result 347 states and 460 transitions. [2025-03-08 19:06:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:34,086 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-03-08 19:06:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:34,087 INFO L225 Difference]: With dead ends: 347 [2025-03-08 19:06:34,087 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 19:06:34,087 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-03-08 19:06:34,088 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 185 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 266 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-03-08 19:06:34,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 266 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 19:06:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 19:06:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-03-08 19:06:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 273 states have internal predecessors, (359), 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-03-08 19:06:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 453 transitions. [2025-03-08 19:06:34,103 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 453 transitions. Word has length 20 [2025-03-08 19:06:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:34,103 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 453 transitions. [2025-03-08 19:06:34,103 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-03-08 19:06:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 453 transitions. [2025-03-08 19:06:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 19:06:34,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:34,104 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-03-08 19:06:34,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:06:34,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash -762878531, now seen corresponding path program 1 times [2025-03-08 19:06:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:34,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780174599] [2025-03-08 19:06:34,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:35,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 19:06:35,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 19:06:35,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:35,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780174599] [2025-03-08 19:06:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780174599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:35,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377940221] [2025-03-08 19:06:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:35,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:35,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:35,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:35,977 INFO L87 Difference]: Start difference. First operand 341 states and 453 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-03-08 19:06:40,004 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-03-08 19:06:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:40,437 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2025-03-08 19:06:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:40,438 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-03-08 19:06:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:40,439 INFO L225 Difference]: With dead ends: 343 [2025-03-08 19:06:40,439 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 19:06:40,440 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-03-08 19:06:40,440 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 232 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-03-08 19:06:40,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 232 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 19:06:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 19:06:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-08 19:06:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 265 states have internal predecessors, (350), 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-03-08 19:06:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 443 transitions. [2025-03-08 19:06:40,461 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 443 transitions. Word has length 21 [2025-03-08 19:06:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 443 transitions. [2025-03-08 19:06:40,461 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-03-08 19:06:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 443 transitions. [2025-03-08 19:06:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 19:06:40,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:40,463 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] [2025-03-08 19:06:40,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:06:40,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:40,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1582853400, now seen corresponding path program 1 times [2025-03-08 19:06:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908068276] [2025-03-08 19:06:40,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:42,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 19:06:42,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 19:06:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:06:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908068276] [2025-03-08 19:06:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908068276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976120790] [2025-03-08 19:06:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:42,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:42,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:42,257 INFO L87 Difference]: Start difference. First operand 333 states and 443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03-08 19:06:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:42,547 INFO L93 Difference]: Finished difference Result 859 states and 1150 transitions. [2025-03-08 19:06:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 42 [2025-03-08 19:06:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:42,550 INFO L225 Difference]: With dead ends: 859 [2025-03-08 19:06:42,550 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 19:06:42,551 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-03-08 19:06:42,551 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 132 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 19:06:42,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 434 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 19:06:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 19:06:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-08 19:06:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 431 states have (on average 1.3433874709976799) internal successors, (579), 435 states have internal predecessors, (579), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 19:06:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 708 transitions. [2025-03-08 19:06:42,571 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 708 transitions. Word has length 42 [2025-03-08 19:06:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:42,571 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 708 transitions. [2025-03-08 19:06:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03-08 19:06:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 708 transitions. [2025-03-08 19:06:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 19:06:42,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:06:42,573 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-03-08 19:06:42,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:06:42,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:06:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:06:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1289867569, now seen corresponding path program 1 times [2025-03-08 19:06:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:06:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353055951] [2025-03-08 19:06:42,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:06:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:06:44,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 19:06:44,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 19:06:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:06:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:06:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 19:06:44,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:06:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353055951] [2025-03-08 19:06:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353055951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:06:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:06:44,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:06:44,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17803776] [2025-03-08 19:06:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:06:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:06:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:06:44,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:06:44,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:06:44,443 INFO L87 Difference]: Start difference. First operand 529 states and 708 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-03-08 19:06:48,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:06:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:06:48,964 INFO L93 Difference]: Finished difference Result 529 states and 708 transitions. [2025-03-08 19:06:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:06:48,968 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-03-08 19:06:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:06:48,970 INFO L225 Difference]: With dead ends: 529 [2025-03-08 19:06:48,970 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:06:48,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-08 19:06:48,971 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 22 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 407 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-03-08 19:06:48,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 407 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 19:06:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:06:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:06:48,972 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-03-08 19:06:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:06:48,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-08 19:06:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:06:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:06:48,972 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-03-08 19:06:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:06:48,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:06:48,975 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:06:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:06:48,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:06:48,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 19:07:21,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 19:07:21,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:07:21 BoogieIcfgContainer [2025-03-08 19:07:21,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 19:07:21,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 19:07:21,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 19:07:21,720 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 19:07:21,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:06:05" (3/4) ... [2025-03-08 19:07:21,723 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-03-08 19:07:21,727 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-08 19:07:21,737 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2025-03-08 19:07:21,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-08 19:07:21,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 19:07:21,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 19:07:21,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:07:21,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 19:07:21,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 19:07:21,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 19:07:21,858 INFO L158 Benchmark]: Toolchain (without parser) took 82903.80ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 121.0MB in the beginning and 832.3MB in the end (delta: -711.3MB). Peak memory consumption was 482.5MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,858 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:07:21,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.43ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 63.8MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.73ms. Allocated memory is still 167.8MB. Free memory was 63.8MB in the beginning and 58.1MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,859 INFO L158 Benchmark]: Boogie Preprocessor took 128.45ms. Allocated memory is still 167.8MB. Free memory was 58.1MB in the beginning and 47.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,860 INFO L158 Benchmark]: IcfgBuilder took 5473.91ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 69.1MB in the end (delta: -22.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,860 INFO L158 Benchmark]: TraceAbstraction took 76423.38ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 68.1MB in the beginning and 848.8MB in the end (delta: -780.8MB). Peak memory consumption was 412.0MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,860 INFO L158 Benchmark]: Witness Printer took 137.15ms. Allocated memory is still 1.4GB. Free memory was 848.8MB in the beginning and 832.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 19:07:21,861 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.41ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.43ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 63.8MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.73ms. Allocated memory is still 167.8MB. Free memory was 63.8MB in the beginning and 58.1MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.45ms. Allocated memory is still 167.8MB. Free memory was 58.1MB in the beginning and 47.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5473.91ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 69.1MB in the end (delta: -22.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 76423.38ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 68.1MB in the beginning and 848.8MB in the end (delta: -780.8MB). Peak memory consumption was 412.0MB. Max. memory is 16.1GB. * Witness Printer took 137.15ms. Allocated memory is still 1.4GB. Free memory was 848.8MB in the beginning and 832.3MB in the end (delta: 16.6MB). 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, 285 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1457 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1457 mSDsluCounter, 2560 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1890 mSDtfsCounter, 53 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.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=529occurred 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.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 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-03-08 19:07:22,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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