./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /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 --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /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 -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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:59:47,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:59:47,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 07:59:47,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:59:47,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:59:47,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:59:47,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:59:47,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:59:47,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:59:47,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:59:47,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:59:47,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:59:47,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:59:47,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:59:47,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:59:47,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:59:47,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:59:47,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:59:47,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:59:47,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:59:47,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:59:47,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:59:47,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:59:47,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:59:47,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:59:47,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:59:47,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:59:47,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:59:47,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:59:47,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:59:47,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:59:47,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:59:47,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:59:47,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:59:47,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:59:47,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:59:47,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:59:47,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:59:47,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:59:47,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-13 07:59:47,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:59:47,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:59:47,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:59:47,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:59:47,547 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:59:47,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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 [2024-10-13 07:59:48,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:59:49,145 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:59:49,146 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 [2024-10-13 07:59:49,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf78915fd/b1dccabfaf3b4541b97e54825f509af1/FLAGfd407c216 [2024-10-13 07:59:49,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf78915fd/b1dccabfaf3b4541b97e54825f509af1 [2024-10-13 07:59:49,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:59:49,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:59:49,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:59:49,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:59:49,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:59:49,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:59:49" (1/1) ... [2024-10-13 07:59:49,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641d0901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:49, skipping insertion in model container [2024-10-13 07:59:49,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:59:49" (1/1) ... [2024-10-13 07:59:49,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:59:49,763 WARN L248 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] [2024-10-13 07:59:49,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:59:49,856 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:59:49,953 WARN L248 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] [2024-10-13 07:59:49,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:59:50,023 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:59:50,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50 WrapperNode [2024-10-13 07:59:50,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:59:50,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:59:50,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:59:50,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:59:50,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,112 INFO L138 Inliner]: procedures = 99, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 784 [2024-10-13 07:59:50,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:59:50,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:59:50,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:59:50,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:59:50,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,199 INFO L175 MemorySlicer]: Split 221 memory accesses to 6 slices as follows [2, 14, 63, 12, 100, 30]. 45 percent of accesses are in the largest equivalence class. The 195 initializations are split as follows [2, 0, 63, 0, 100, 30]. The 14 writes are split as follows [0, 2, 0, 12, 0, 0]. [2024-10-13 07:59:50,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:59:50,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:59:50,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:59:50,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:59:50,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (1/1) ... [2024-10-13 07:59:50,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:59:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:59:50,285 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) [2024-10-13 07:59:50,287 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 [2024-10-13 07:59:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2024-10-13 07:59:50,322 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2024-10-13 07:59:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 07:59:50,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 07:59:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:59:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:59:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-10-13 07:59:50,323 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-13 07:59:50,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-13 07:59:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2024-10-13 07:59:50,323 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-10-13 07:59:50,324 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:59:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 07:59:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2024-10-13 07:59:50,326 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-13 07:59:50,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 07:59:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-13 07:59:50,327 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 07:59:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 07:59:50,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-13 07:59:50,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-13 07:59:50,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:59:50,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:59:50,328 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-13 07:59:50,328 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-13 07:59:50,521 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:59:50,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:59:51,246 INFO L? ?]: Removed 263 outVars from TransFormulas that were not future-live. [2024-10-13 07:59:51,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:59:51,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:59:51,347 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 07:59:51,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:59:51 BoogieIcfgContainer [2024-10-13 07:59:51,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:59:51,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:59:51,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:59:51,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:59:51,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:59:49" (1/3) ... [2024-10-13 07:59:51,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2931abfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:59:51, skipping insertion in model container [2024-10-13 07:59:51,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:59:50" (2/3) ... [2024-10-13 07:59:51,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2931abfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:59:51, skipping insertion in model container [2024-10-13 07:59:51,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:59:51" (3/3) ... [2024-10-13 07:59:51,354 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-13 07:59:51,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:59:51,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 07:59:51,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:59:51,429 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;@19301d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:59:51,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 07:59:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 97 states have (on average 1.556701030927835) internal successors, (151), 105 states have internal predecessors, (151), 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) [2024-10-13 07:59:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 07:59:51,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:51,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:51,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -963144185, now seen corresponding path program 1 times [2024-10-13 07:59:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603124133] [2024-10-13 07:59:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603124133] [2024-10-13 07:59:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603124133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:59:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500361748] [2024-10-13 07:59:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:51,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:51,892 INFO L87 Difference]: Start difference. First operand has 139 states, 97 states have (on average 1.556701030927835) internal successors, (151), 105 states have internal predecessors, (151), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-10-13 07:59:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:52,078 INFO L93 Difference]: Finished difference Result 401 states and 625 transitions. [2024-10-13 07:59:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:52,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-10-13 07:59:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:52,092 INFO L225 Difference]: With dead ends: 401 [2024-10-13 07:59:52,092 INFO L226 Difference]: Without dead ends: 261 [2024-10-13 07:59:52,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,100 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 176 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:52,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 324 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-13 07:59:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2024-10-13 07:59:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 184 states have (on average 1.516304347826087) internal successors, (279), 191 states have internal predecessors, (279), 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) [2024-10-13 07:59:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2024-10-13 07:59:52,164 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 11 [2024-10-13 07:59:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:52,165 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2024-10-13 07:59:52,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-10-13 07:59:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2024-10-13 07:59:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 07:59:52,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:52,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:52,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:59:52,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 780998210, now seen corresponding path program 1 times [2024-10-13 07:59:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596260716] [2024-10-13 07:59:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596260716] [2024-10-13 07:59:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596260716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 07:59:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099349822] [2024-10-13 07:59:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:52,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,285 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-13 07:59:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:52,367 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2024-10-13 07:59:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-10-13 07:59:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:52,370 INFO L225 Difference]: With dead ends: 279 [2024-10-13 07:59:52,372 INFO L226 Difference]: Without dead ends: 268 [2024-10-13 07:59:52,372 INFO L431 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 [2024-10-13 07:59:52,374 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 194 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:52,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 189 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-13 07:59:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2024-10-13 07:59:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 184 states have (on average 1.5108695652173914) internal successors, (278), 191 states have internal predecessors, (278), 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) [2024-10-13 07:59:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2024-10-13 07:59:52,410 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 14 [2024-10-13 07:59:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:52,410 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2024-10-13 07:59:52,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-13 07:59:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2024-10-13 07:59:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 07:59:52,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:52,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:52,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:59:52,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 838256512, now seen corresponding path program 1 times [2024-10-13 07:59:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87534345] [2024-10-13 07:59:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87534345] [2024-10-13 07:59:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87534345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:59:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944806480] [2024-10-13 07:59:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:52,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,500 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-13 07:59:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:52,617 INFO L93 Difference]: Finished difference Result 259 states and 377 transitions. [2024-10-13 07:59:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 14 [2024-10-13 07:59:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:52,620 INFO L225 Difference]: With dead ends: 259 [2024-10-13 07:59:52,620 INFO L226 Difference]: Without dead ends: 256 [2024-10-13 07:59:52,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,621 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:52,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 161 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-13 07:59:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-13 07:59:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 190 states have internal predecessors, (277), 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) [2024-10-13 07:59:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2024-10-13 07:59:52,679 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 14 [2024-10-13 07:59:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:52,679 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2024-10-13 07:59:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-13 07:59:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2024-10-13 07:59:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 07:59:52,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:52,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:52,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:59:52,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:52,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:52,687 INFO L85 PathProgramCache]: Analyzing trace with hash 216028979, now seen corresponding path program 1 times [2024-10-13 07:59:52,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:52,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318604618] [2024-10-13 07:59:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318604618] [2024-10-13 07:59:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318604618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:59:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540174640] [2024-10-13 07:59:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:52,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,830 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2024-10-13 07:59:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:52,989 INFO L93 Difference]: Finished difference Result 258 states and 375 transitions. [2024-10-13 07:59:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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 [2024-10-13 07:59:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:52,992 INFO L225 Difference]: With dead ends: 258 [2024-10-13 07:59:52,992 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 07:59:52,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:52,994 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:52,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 159 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 07:59:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-13 07:59:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 184 states have (on average 1.5) internal successors, (276), 189 states have internal predecessors, (276), 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) [2024-10-13 07:59:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 372 transitions. [2024-10-13 07:59:53,021 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 372 transitions. Word has length 15 [2024-10-13 07:59:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:53,022 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 372 transitions. [2024-10-13 07:59:53,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2024-10-13 07:59:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 372 transitions. [2024-10-13 07:59:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 07:59:53,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:53,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:53,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 07:59:53,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:53,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1893150493, now seen corresponding path program 1 times [2024-10-13 07:59:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:53,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868706859] [2024-10-13 07:59:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:53,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868706859] [2024-10-13 07:59:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868706859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:59:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403955391] [2024-10-13 07:59:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:53,116 INFO L87 Difference]: Start difference. First operand 255 states and 372 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-13 07:59:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:53,219 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2024-10-13 07:59:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 16 [2024-10-13 07:59:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:53,221 INFO L225 Difference]: With dead ends: 263 [2024-10-13 07:59:53,221 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 07:59:53,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:53,222 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:53,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 177 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 07:59:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-10-13 07:59:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 186 states have (on average 1.478494623655914) internal successors, (275), 189 states have internal predecessors, (275), 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) [2024-10-13 07:59:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 369 transitions. [2024-10-13 07:59:53,240 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 369 transitions. Word has length 16 [2024-10-13 07:59:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 369 transitions. [2024-10-13 07:59:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-13 07:59:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 369 transitions. [2024-10-13 07:59:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 07:59:53,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:53,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:53,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 07:59:53,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1441767478, now seen corresponding path program 1 times [2024-10-13 07:59:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948384194] [2024-10-13 07:59:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948384194] [2024-10-13 07:59:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948384194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 07:59:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773876782] [2024-10-13 07:59:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:59:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:59:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:53,290 INFO L87 Difference]: Start difference. First operand 257 states and 369 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-10-13 07:59:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:53,372 INFO L93 Difference]: Finished difference Result 259 states and 370 transitions. [2024-10-13 07:59:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:59:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 17 [2024-10-13 07:59:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:53,373 INFO L225 Difference]: With dead ends: 259 [2024-10-13 07:59:53,374 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 07:59:53,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 07:59:53,374 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:53,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 07:59:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 07:59:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-13 07:59:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 183 states have internal predecessors, (268), 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) [2024-10-13 07:59:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 361 transitions. [2024-10-13 07:59:53,395 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 361 transitions. Word has length 17 [2024-10-13 07:59:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:53,395 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 361 transitions. [2024-10-13 07:59:53,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2024-10-13 07:59:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 361 transitions. [2024-10-13 07:59:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 07:59:53,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:53,400 INFO L215 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] [2024-10-13 07:59:53,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 07:59:53,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:53,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash -468234048, now seen corresponding path program 1 times [2024-10-13 07:59:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279889386] [2024-10-13 07:59:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 07:59:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:59:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 07:59:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 07:59:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 07:59:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279889386] [2024-10-13 07:59:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279889386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:53,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:59:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120877567] [2024-10-13 07:59:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:59:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:53,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:59:53,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:59:53,522 INFO L87 Difference]: Start difference. First operand 251 states and 361 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 07:59:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:53,917 INFO L93 Difference]: Finished difference Result 653 states and 956 transitions. [2024-10-13 07:59:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 07:59:53,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 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 37 [2024-10-13 07:59:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:53,921 INFO L225 Difference]: With dead ends: 653 [2024-10-13 07:59:53,921 INFO L226 Difference]: Without dead ends: 403 [2024-10-13 07:59:53,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:59:53,923 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 153 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:53,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 408 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 07:59:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-13 07:59:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 391. [2024-10-13 07:59:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 293 states have (on average 1.5051194539249146) internal successors, (441), 297 states have internal predecessors, (441), 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) [2024-10-13 07:59:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 570 transitions. [2024-10-13 07:59:53,945 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 570 transitions. Word has length 37 [2024-10-13 07:59:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 570 transitions. [2024-10-13 07:59:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 07:59:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 570 transitions. [2024-10-13 07:59:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 07:59:53,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:59:53,947 INFO L215 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] [2024-10-13 07:59:53,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:59:53,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:59:53,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:59:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1861036521, now seen corresponding path program 1 times [2024-10-13 07:59:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:59:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605893591] [2024-10-13 07:59:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:59:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:59:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 07:59:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:59:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 07:59:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 07:59:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:59:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 07:59:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:59:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605893591] [2024-10-13 07:59:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605893591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:59:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:59:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:59:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689134757] [2024-10-13 07:59:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:59:54,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:59:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:59:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:59:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:59:54,056 INFO L87 Difference]: Start difference. First operand 391 states and 570 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 07:59:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:59:54,310 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2024-10-13 07:59:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 07:59:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 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 45 [2024-10-13 07:59:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:59:54,311 INFO L225 Difference]: With dead ends: 403 [2024-10-13 07:59:54,311 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 07:59:54,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:59:54,313 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:59:54,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 395 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 07:59:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 07:59:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 07:59:54,314 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) [2024-10-13 07:59:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 07:59:54,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-13 07:59:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:59:54,314 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 07:59:54,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 07:59:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 07:59:54,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 07:59:54,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 07:59:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 07:59:54,327 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:59:54,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 07:59:55,758 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 07:59:55,782 WARN L155 FloydHoareUtils]: Requires clause for ldv_mutex_lock_mtx_of_isl_pmic contained old-variable. Original clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= 1 |old(~ldv_mutex_mtx_of_isl_pmic~0)|) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-13 07:59:55,785 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= |old(#valid)| |#valid|) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-13 07:59:55,788 WARN L155 FloydHoareUtils]: Requires clause for ldv_mutex_unlock_mtx_of_isl_pmic contained old-variable. Original clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 2 |old(~ldv_mutex_mtx_of_isl_pmic~0)|) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)) [2024-10-13 07:59:55,790 WARN L155 FloydHoareUtils]: Requires clause for rdev_get_drvdata contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= |old(#valid)| |#valid|) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-13 07:59:55,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:59:55 BoogieIcfgContainer [2024-10-13 07:59:55,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 07:59:55,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 07:59:55,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 07:59:55,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 07:59:55,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:59:51" (3/4) ... [2024-10-13 07:59:55,801 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 07:59:55,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2024-10-13 07:59:55,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-13 07:59:55,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-13 07:59:55,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-13 07:59:55,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2024-10-13 07:59:55,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2024-10-13 07:59:55,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-13 07:59:55,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2024-10-13 07:59:55,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2024-10-13 07:59:55,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-13 07:59:55,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-13 07:59:55,826 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2024-10-13 07:59:55,828 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-13 07:59:55,832 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 07:59:55,833 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 07:59:55,833 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 07:59:56,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 07:59:56,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 07:59:56,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 07:59:56,065 INFO L158 Benchmark]: Toolchain (without parser) took 6882.96ms. Allocated memory was 148.9MB in the beginning and 320.9MB in the end (delta: 172.0MB). Free memory was 76.9MB in the beginning and 206.6MB in the end (delta: -129.7MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,065 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 148.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 07:59:56,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.05ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 76.5MB in the beginning and 124.7MB in the end (delta: -48.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.02ms. Allocated memory is still 190.8MB. Free memory was 124.7MB in the beginning and 118.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,066 INFO L158 Benchmark]: Boogie Preprocessor took 136.40ms. Allocated memory is still 190.8MB. Free memory was 118.6MB in the beginning and 107.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,066 INFO L158 Benchmark]: RCFGBuilder took 1095.42ms. Allocated memory is still 190.8MB. Free memory was 107.0MB in the beginning and 86.9MB in the end (delta: 20.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,067 INFO L158 Benchmark]: TraceAbstraction took 4447.08ms. Allocated memory was 190.8MB in the beginning and 320.9MB in the end (delta: 130.0MB). Free memory was 85.8MB in the beginning and 224.5MB in the end (delta: -138.7MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,067 INFO L158 Benchmark]: Witness Printer took 268.27ms. Allocated memory is still 320.9MB. Free memory was 224.5MB in the beginning and 206.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 07:59:56,068 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 148.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.05ms. Allocated memory was 148.9MB in the beginning and 190.8MB in the end (delta: 41.9MB). Free memory was 76.5MB in the beginning and 124.7MB in the end (delta: -48.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.02ms. Allocated memory is still 190.8MB. Free memory was 124.7MB in the beginning and 118.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.40ms. Allocated memory is still 190.8MB. Free memory was 118.6MB in the beginning and 107.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.42ms. Allocated memory is still 190.8MB. Free memory was 107.0MB in the beginning and 86.9MB in the end (delta: 20.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4447.08ms. Allocated memory was 190.8MB in the beginning and 320.9MB in the end (delta: 130.0MB). Free memory was 85.8MB in the beginning and 224.5MB in the end (delta: -138.7MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 268.27ms. Allocated memory is still 320.9MB. Free memory was 224.5MB in the beginning and 206.6MB in the end (delta: 17.8MB). 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, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1288 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 1967 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 739 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 1228 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=7, InterpolantAutomatonStates: 34, 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, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2172]: Location Invariant Derived location invariant: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3197]: Procedure Contract for mutex_unlock Derived contract for procedure mutex_unlock. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 2942]: Procedure Contract for ldv_mutex_lock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_lock_mtx_of_isl_pmic. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (1 == \old(ldv_mutex_mtx_of_isl_pmic))) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) - ProcedureContractResult [Line: 3158]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 2684]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3214]: Procedure Contract for regulator_unregister Derived contract for procedure regulator_unregister. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3190]: Procedure Contract for mutex_lock Derived contract for procedure mutex_lock. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) - ProcedureContractResult [Line: 3000]: Procedure Contract for ldv_mutex_unlock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_unlock_mtx_of_isl_pmic. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (2 == \old(ldv_mutex_mtx_of_isl_pmic))) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3200]: Procedure Contract for rdev_get_drvdata Derived contract for procedure rdev_get_drvdata. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3204]: Procedure Contract for regulator_list_voltage_linear Derived contract for procedure regulator_list_voltage_linear. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3149]: Procedure Contract for dev_err Derived contract for procedure dev_err. Requires: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) || (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1))) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) || (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1))) - ProcedureContractResult [Line: 2172]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) RESULT: Ultimate proved your program to be correct! [2024-10-13 07:59:56,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE