./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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.fs.icfgbuilder-eval-023d838-m [2024-11-10 12:03:24,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 12:03:24,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 12:03:24,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 12:03:24,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 12:03:24,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 12:03:24,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 12:03:24,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 12:03:24,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 12:03:24,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 12:03:24,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 12:03:24,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 12:03:24,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 12:03:24,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 12:03:24,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 12:03:24,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 12:03:24,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 12:03:24,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 12:03:24,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 12:03:24,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 12:03:24,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 12:03:24,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 12:03:24,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 12:03:24,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 12:03:24,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 12:03:24,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 12:03:24,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 12:03:24,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 12:03:24,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 12:03:24,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 12:03:24,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 12:03:24,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 12:03:24,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 12:03:24,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 12:03:24,988 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-11-10 12:03:25,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 12:03:25,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 12:03:25,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 12:03:25,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 12:03:25,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 12:03:25,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-11-10 12:03:26,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 12:03:26,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 12:03:26,717 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-11-10 12:03:26,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bd37f89/cf42ec70dce3492fa64d3d4f285aa10e/FLAGfde40ace4 [2024-11-10 12:03:26,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bd37f89/cf42ec70dce3492fa64d3d4f285aa10e [2024-11-10 12:03:26,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 12:03:26,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 12:03:26,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 12:03:26,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 12:03:26,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 12:03:26,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:26" (1/1) ... [2024-11-10 12:03:26,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcc374b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:26, skipping insertion in model container [2024-11-10 12:03:26,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:03:26" (1/1) ... [2024-11-10 12:03:26,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 12:03:27,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-11-10 12:03:27,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 12:03:27,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 12:03:27,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-11-10 12:03:27,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 12:03:27,668 INFO L204 MainTranslator]: Completed translation [2024-11-10 12:03:27,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27 WrapperNode [2024-11-10 12:03:27,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 12:03:27,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 12:03:27,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 12:03:27,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 12:03:27,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,771 INFO L138 Inliner]: procedures = 100, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 810 [2024-11-10 12:03:27,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 12:03:27,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 12:03:27,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 12:03:27,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 12:03:27,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,860 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 65, 103, 32, 14]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 10, 0, 0]. The 204 writes are split as follows [0, 12, 65, 93, 32, 2]. [2024-11-10 12:03:27,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 12:03:27,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 12:03:27,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 12:03:27,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 12:03:27,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (1/1) ... [2024-11-10 12:03:27,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 12:03:27,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 12:03:27,936 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-11-10 12:03:27,940 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-11-10 12:03:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-10 12:03:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-10 12:03:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-10 12:03:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2024-11-10 12:03:27,982 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-10 12:03:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 12:03:27,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 12:03:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 12:03:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 12:03:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 12:03:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 12:03:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 12:03:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 12:03:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-10 12:03:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-10 12:03:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-10 12:03:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-10 12:03:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2024-11-10 12:03:27,986 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2024-11-10 12:03:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 12:03:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-10 12:03:27,986 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-10 12:03:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 12:03:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-10 12:03:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2024-11-10 12:03:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-11-10 12:03:27,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-11-10 12:03:27,990 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 12:03:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-11-10 12:03:27,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 12:03:27,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 12:03:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-11-10 12:03:27,991 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-11-10 12:03:28,229 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 12:03:28,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 12:03:28,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet122; [2024-11-10 12:03:28,292 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret121.base, #t~ret121.offset; [2024-11-10 12:03:28,304 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet109; [2024-11-10 12:03:33,440 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2024-11-10 12:03:33,440 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300: call ULTIMATE.dealloc(isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset);havoc isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset;call ULTIMATE.dealloc(isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset);havoc isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset; [2024-11-10 12:03:33,440 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet123#1; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret124#1.base, regulator_register_#t~ret124#1.offset; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet117#1; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret114#1.base, dev_get_drvdata_#t~ret114#1.offset; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet118#1; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet115#1; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet119#1; [2024-11-10 12:03:33,441 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret116#1.base, devm_kzalloc_#t~ret116#1.offset; [2024-11-10 12:03:33,535 INFO L? ?]: Removed 258 outVars from TransFormulas that were not future-live. [2024-11-10 12:03:33,535 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 12:03:33,554 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 12:03:33,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 12:03:33,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:03:33 BoogieIcfgContainer [2024-11-10 12:03:33,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 12:03:33,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 12:03:33,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 12:03:33,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 12:03:33,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:03:26" (1/3) ... [2024-11-10 12:03:33,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f071bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:03:33, skipping insertion in model container [2024-11-10 12:03:33,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:03:27" (2/3) ... [2024-11-10 12:03:33,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f071bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:03:33, skipping insertion in model container [2024-11-10 12:03:33,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:03:33" (3/3) ... [2024-11-10 12:03:33,562 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-11-10 12:03:33,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 12:03:33,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 12:03:33,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 12:03:33,665 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;@6a026cfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 12:03:33,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 12:03:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 150 states have (on average 1.36) internal successors, (204), 158 states have internal predecessors, (204), 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-11-10 12:03:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 12:03:33,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:03:33,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 12:03:33,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:03:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:03:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -865652610, now seen corresponding path program 1 times [2024-11-10 12:03:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:03:33,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324277223] [2024-11-10 12:03:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:03:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:03:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:03:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:03:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:03:36,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324277223] [2024-11-10 12:03:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324277223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:03:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:03:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:03:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012506429] [2024-11-10 12:03:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:03:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:03:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:03:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:03:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:03:36,532 INFO L87 Difference]: Start difference. First operand has 192 states, 150 states have (on average 1.36) internal successors, (204), 158 states have internal predecessors, (204), 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 5.0) internal successors, (15), 3 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-11-10 12:03:40,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:03:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:03:41,276 INFO L93 Difference]: Finished difference Result 546 states and 770 transitions. [2024-11-10 12:03:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:03:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11-10 12:03:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:03:41,296 INFO L225 Difference]: With dead ends: 546 [2024-11-10 12:03:41,296 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 12:03:41,300 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-11-10 12:03:41,304 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 221 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 12:03:41,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 12:03:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 12:03:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 348. [2024-11-10 12:03:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 275 states have (on average 1.3454545454545455) internal successors, (370), 282 states have internal predecessors, (370), 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-11-10 12:03:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 468 transitions. [2024-11-10 12:03:41,382 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 468 transitions. Word has length 16 [2024-11-10 12:03:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:03:41,382 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 468 transitions. [2024-11-10 12:03:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11-10 12:03:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 468 transitions. [2024-11-10 12:03:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 12:03:41,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:03:41,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 12:03:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 12:03:41,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:03:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:03:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -940879149, now seen corresponding path program 1 times [2024-11-10 12:03:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:03:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691916382] [2024-11-10 12:03:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:03:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:03:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:03:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:03:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:03:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691916382] [2024-11-10 12:03:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691916382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:03:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:03:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:03:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039757480] [2024-11-10 12:03:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:03:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:03:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:03:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:03:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:03:43,695 INFO L87 Difference]: Start difference. First operand 348 states and 468 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:03:43,816 INFO L93 Difference]: Finished difference Result 372 states and 496 transitions. [2024-11-10 12:03:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:03:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 12:03:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:03:43,819 INFO L225 Difference]: With dead ends: 372 [2024-11-10 12:03:43,819 INFO L226 Difference]: Without dead ends: 360 [2024-11-10 12:03:43,819 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-11-10 12:03:43,820 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 243 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 12:03:43,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 12:03:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-10 12:03:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 348. [2024-11-10 12:03:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 275 states have (on average 1.3418181818181818) internal successors, (369), 282 states have internal predecessors, (369), 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-11-10 12:03:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 467 transitions. [2024-11-10 12:03:43,852 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 467 transitions. Word has length 19 [2024-11-10 12:03:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:03:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 467 transitions. [2024-11-10 12:03:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2024-11-10 12:03:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 12:03:43,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:03:43,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 12:03:43,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 12:03:43,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:03:43,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:03:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -53375468, now seen corresponding path program 1 times [2024-11-10 12:03:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:03:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453291735] [2024-11-10 12:03:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:03:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:03:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:03:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:03:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:03:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453291735] [2024-11-10 12:03:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453291735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:03:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:03:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:03:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892284386] [2024-11-10 12:03:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:03:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:03:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:03:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:03:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:03:45,873 INFO L87 Difference]: Start difference. First operand 348 states and 467 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:49,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:03:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:03:50,395 INFO L93 Difference]: Finished difference Result 351 states and 469 transitions. [2024-11-10 12:03:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:03:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 12:03:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:03:50,399 INFO L225 Difference]: With dead ends: 351 [2024-11-10 12:03:50,399 INFO L226 Difference]: Without dead ends: 347 [2024-11-10 12:03:50,399 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-11-10 12:03:50,400 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 12:03:50,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 244 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 12:03:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-10 12:03:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-10 12:03:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.3381818181818181) internal successors, (368), 281 states have internal predecessors, (368), 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-11-10 12:03:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 465 transitions. [2024-11-10 12:03:50,425 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 465 transitions. Word has length 19 [2024-11-10 12:03:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:03:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 465 transitions. [2024-11-10 12:03:50,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 465 transitions. [2024-11-10 12:03:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 12:03:50,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:03:50,427 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] [2024-11-10 12:03:50,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 12:03:50,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:03:50,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:03:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1664450294, now seen corresponding path program 1 times [2024-11-10 12:03:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:03:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294630005] [2024-11-10 12:03:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:03:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:03:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:03:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:03:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:03:52,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294630005] [2024-11-10 12:03:52,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294630005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:03:52,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:03:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:03:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886510353] [2024-11-10 12:03:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:03:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:03:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:03:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:03:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:03:52,488 INFO L87 Difference]: Start difference. First operand 347 states and 465 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:56,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:03:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:03:56,983 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2024-11-10 12:03:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:03:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 12:03:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:03:56,988 INFO L225 Difference]: With dead ends: 350 [2024-11-10 12:03:56,988 INFO L226 Difference]: Without dead ends: 346 [2024-11-10 12:03:56,988 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-11-10 12:03:56,989 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 12:03:56,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 242 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 12:03:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-10 12:03:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-10 12:03:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 280 states have internal predecessors, (367), 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-11-10 12:03:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 463 transitions. [2024-11-10 12:03:57,016 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 463 transitions. Word has length 20 [2024-11-10 12:03:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:03:57,016 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 463 transitions. [2024-11-10 12:03:57,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:03:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 463 transitions. [2024-11-10 12:03:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 12:03:57,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:03:57,036 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] [2024-11-10 12:03:57,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 12:03:57,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:03:57,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:03:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash -68194061, now seen corresponding path program 1 times [2024-11-10 12:03:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:03:57,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782990661] [2024-11-10 12:03:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:03:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:03:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:03:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:03:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:03:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782990661] [2024-11-10 12:03:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782990661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:03:59,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:03:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:03:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237149916] [2024-11-10 12:03:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:03:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:03:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:03:59,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:03:59,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:03:59,014 INFO L87 Difference]: Start difference. First operand 346 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:04:03,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:04:03,570 INFO L93 Difference]: Finished difference Result 358 states and 471 transitions. [2024-11-10 12:04:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:04:03,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-10 12:04:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:04:03,574 INFO L225 Difference]: With dead ends: 358 [2024-11-10 12:04:03,574 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 12:04:03,574 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-11-10 12:04:03,578 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 190 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 12:04:03,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 272 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 12:04:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 12:04:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2024-11-10 12:04:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 279 states have (on average 1.3189964157706093) internal successors, (368), 282 states have internal predecessors, (368), 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-11-10 12:04:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2024-11-10 12:04:03,603 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 21 [2024-11-10 12:04:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:04:03,604 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2024-11-10 12:04:03,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 12:04:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2024-11-10 12:04:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 12:04:03,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:04:03,606 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] [2024-11-10 12:04:03,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 12:04:03,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:04:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:04:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2123890103, now seen corresponding path program 1 times [2024-11-10 12:04:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:04:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936543288] [2024-11-10 12:04:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:04:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:04:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:04:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:04:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936543288] [2024-11-10 12:04:05,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936543288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:04:05,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:04:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 12:04:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499754059] [2024-11-10 12:04:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:04:05,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 12:04:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:04:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 12:04:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:04:05,652 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-10 12:04:09,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:04:10,153 INFO L93 Difference]: Finished difference Result 353 states and 464 transitions. [2024-11-10 12:04:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 12:04:10,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2024-11-10 12:04:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:04:10,157 INFO L225 Difference]: With dead ends: 353 [2024-11-10 12:04:10,157 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 12:04:10,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 12:04:10,159 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 12:04:10,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 237 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 12:04:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 12:04:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-10 12:04:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 272 states have (on average 1.3198529411764706) internal successors, (359), 274 states have internal predecessors, (359), 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-11-10 12:04:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 452 transitions. [2024-11-10 12:04:10,177 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 452 transitions. Word has length 22 [2024-11-10 12:04:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:04:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 452 transitions. [2024-11-10 12:04:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-10 12:04:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 452 transitions. [2024-11-10 12:04:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 12:04:10,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:04:10,180 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, 1, 1, 1, 1, 1, 1] [2024-11-10 12:04:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 12:04:10,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:04:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:04:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash -138943010, now seen corresponding path program 1 times [2024-11-10 12:04:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:04:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801650648] [2024-11-10 12:04:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:04:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:04:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:12,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 12:04:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:12,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 12:04:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 12:04:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 12:04:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 12:04:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:04:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801650648] [2024-11-10 12:04:12,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801650648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:04:12,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:04:12,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 12:04:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545089726] [2024-11-10 12:04:12,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:04:12,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 12:04:12,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:04:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 12:04:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 12:04:12,448 INFO L87 Difference]: Start difference. First operand 342 states and 452 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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-11-10 12:04:16,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:20,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:04:24,577 INFO L93 Difference]: Finished difference Result 899 states and 1202 transitions. [2024-11-10 12:04:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 12:04:24,578 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), 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 43 [2024-11-10 12:04:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:04:24,583 INFO L225 Difference]: With dead ends: 899 [2024-11-10 12:04:24,583 INFO L226 Difference]: Without dead ends: 560 [2024-11-10 12:04:24,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 12:04:24,585 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 216 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-10 12:04:24,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 635 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2024-11-10 12:04:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-10 12:04:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 546. [2024-11-10 12:04:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 448 states have (on average 1.3303571428571428) internal successors, (596), 452 states have internal predecessors, (596), 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-11-10 12:04:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 725 transitions. [2024-11-10 12:04:24,636 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 725 transitions. Word has length 43 [2024-11-10 12:04:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:04:24,637 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 725 transitions. [2024-11-10 12:04:24,637 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), 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-11-10 12:04:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 725 transitions. [2024-11-10 12:04:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 12:04:24,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 12:04:24,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 12:04:24,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 12:04:24,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 12:04:24,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 12:04:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1478178191, now seen corresponding path program 1 times [2024-11-10 12:04:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 12:04:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538940083] [2024-11-10 12:04:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 12:04:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 12:04:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 12:04:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 12:04:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 12:04:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 12:04:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 12:04:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 12:04:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 12:04:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538940083] [2024-11-10 12:04:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538940083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 12:04:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 12:04:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 12:04:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176096824] [2024-11-10 12:04:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 12:04:27,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 12:04:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 12:04:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 12:04:27,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 12:04:27,104 INFO L87 Difference]: Start difference. First operand 546 states and 725 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 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-11-10 12:04:31,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:35,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:39,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 12:04:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 12:04:43,044 INFO L93 Difference]: Finished difference Result 560 states and 751 transitions. [2024-11-10 12:04:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 12:04:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 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 56 [2024-11-10 12:04:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 12:04:43,045 INFO L225 Difference]: With dead ends: 560 [2024-11-10 12:04:43,045 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 12:04:43,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 12:04:43,047 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 80 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 46 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-11-10 12:04:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 623 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2024-11-10 12:04:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 12:04:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 12:04:43,048 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-11-10 12:04:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 12:04:43,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2024-11-10 12:04:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 12:04:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 12:04:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 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-11-10 12:04:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 12:04:43,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 12:04:43,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 12:04:43,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 12:04:43,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 12:04:43,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.