./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.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.graphml --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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 04:14:17,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:14:17,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:14:17,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:14:17,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:14:17,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:14:17,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:14:17,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:14:17,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:14:17,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:14:17,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:14:17,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:14:17,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:14:17,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:14:17,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:14:17,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:14:17,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:14:17,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:14:17,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:14:17,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:14:17,768 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:14:17,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:14:17,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:14:17,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:14:17,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:14:17,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:14:17,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:14:17,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:14:17,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:14:17,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:14:17,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:14:17,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:14:17,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:14:17,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:14:17,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:14:17,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:14:17,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:14:17,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:14:17,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:14:17,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:14:17,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:14:17,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:14:17,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:14:17,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:14:17,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:14:17,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:14:17,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:14:17,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:14:17,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:14:17,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:14:17,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:14:17,793 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:14:17,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:14:17,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:14:17,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:14:17,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:14:17,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:14:17,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:14:17,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:14:17,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:14:17,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:14:17,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:14:17,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:14:17,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:14:17,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:14:17,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:14:17,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:14:17,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:14:17,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2022-07-20 04:14:17,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:14:17,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:14:17,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:14:17,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:14:17,978 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:14:17,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-20 04:14:18,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce16167c/ee9756ab987a49bda4090a7cc5bb7dd7/FLAG2f7d1ee14 [2022-07-20 04:14:18,625 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:14:18,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-20 04:14:18,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce16167c/ee9756ab987a49bda4090a7cc5bb7dd7/FLAG2f7d1ee14 [2022-07-20 04:14:19,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce16167c/ee9756ab987a49bda4090a7cc5bb7dd7 [2022-07-20 04:14:19,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:14:19,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:14:19,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:14:19,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:14:19,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:14:19,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:14:19" (1/1) ... [2022-07-20 04:14:19,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713d4d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:19, skipping insertion in model container [2022-07-20 04:14:19,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:14:19" (1/1) ... [2022-07-20 04:14:19,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:14:19,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:14:20,985 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2022-07-20 04:14:20,988 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2022-07-20 04:14:20,988 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2022-07-20 04:14:20,989 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2022-07-20 04:14:20,989 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2022-07-20 04:14:20,989 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2022-07-20 04:14:20,990 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2022-07-20 04:14:20,990 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2022-07-20 04:14:20,990 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2022-07-20 04:14:20,991 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2022-07-20 04:14:20,991 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2022-07-20 04:14:20,991 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2022-07-20 04:14:20,992 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2022-07-20 04:14:20,995 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2022-07-20 04:14:20,995 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2022-07-20 04:14:20,996 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2022-07-20 04:14:20,996 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2022-07-20 04:14:20,997 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2022-07-20 04:14:20,997 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2022-07-20 04:14:20,998 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2022-07-20 04:14:20,998 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2022-07-20 04:14:20,998 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2022-07-20 04:14:20,998 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2022-07-20 04:14:20,999 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2022-07-20 04:14:21,000 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2022-07-20 04:14:21,001 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2022-07-20 04:14:21,001 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2022-07-20 04:14:21,001 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2022-07-20 04:14:21,001 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2022-07-20 04:14:21,002 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2022-07-20 04:14:21,003 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2022-07-20 04:14:21,003 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2022-07-20 04:14:21,004 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2022-07-20 04:14:21,004 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2022-07-20 04:14:21,005 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2022-07-20 04:14:21,005 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2022-07-20 04:14:21,006 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2022-07-20 04:14:21,006 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2022-07-20 04:14:21,006 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2022-07-20 04:14:21,006 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2022-07-20 04:14:21,007 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2022-07-20 04:14:21,007 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2022-07-20 04:14:21,007 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2022-07-20 04:14:21,008 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2022-07-20 04:14:21,008 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2022-07-20 04:14:21,008 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2022-07-20 04:14:21,008 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2022-07-20 04:14:21,009 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2022-07-20 04:14:21,010 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2022-07-20 04:14:21,010 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2022-07-20 04:14:21,010 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2022-07-20 04:14:21,010 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2022-07-20 04:14:21,011 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2022-07-20 04:14:21,011 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2022-07-20 04:14:21,011 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2022-07-20 04:14:21,012 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2022-07-20 04:14:21,012 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2022-07-20 04:14:21,012 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2022-07-20 04:14:21,012 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2022-07-20 04:14:21,013 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2022-07-20 04:14:21,013 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2022-07-20 04:14:21,014 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2022-07-20 04:14:21,014 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2022-07-20 04:14:21,014 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2022-07-20 04:14:21,015 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2022-07-20 04:14:21,015 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2022-07-20 04:14:21,015 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2022-07-20 04:14:21,016 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2022-07-20 04:14:21,016 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2022-07-20 04:14:21,016 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2022-07-20 04:14:21,016 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2022-07-20 04:14:21,017 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2022-07-20 04:14:21,017 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2022-07-20 04:14:21,017 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2022-07-20 04:14:21,018 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2022-07-20 04:14:21,018 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2022-07-20 04:14:21,018 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2022-07-20 04:14:21,018 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2022-07-20 04:14:21,019 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2022-07-20 04:14:21,019 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2022-07-20 04:14:21,019 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2022-07-20 04:14:21,020 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2022-07-20 04:14:21,034 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2022-07-20 04:14:21,034 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2022-07-20 04:14:21,034 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2022-07-20 04:14:21,034 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2022-07-20 04:14:21,035 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2022-07-20 04:14:21,035 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2022-07-20 04:14:21,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:14:21,068 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:14:21,275 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2022-07-20 04:14:21,277 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2022-07-20 04:14:21,277 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2022-07-20 04:14:21,277 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2022-07-20 04:14:21,278 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2022-07-20 04:14:21,281 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2022-07-20 04:14:21,282 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2022-07-20 04:14:21,282 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2022-07-20 04:14:21,283 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2022-07-20 04:14:21,283 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2022-07-20 04:14:21,284 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2022-07-20 04:14:21,284 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2022-07-20 04:14:21,284 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2022-07-20 04:14:21,287 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2022-07-20 04:14:21,288 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2022-07-20 04:14:21,288 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2022-07-20 04:14:21,289 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2022-07-20 04:14:21,289 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2022-07-20 04:14:21,289 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2022-07-20 04:14:21,290 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2022-07-20 04:14:21,290 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2022-07-20 04:14:21,290 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2022-07-20 04:14:21,291 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2022-07-20 04:14:21,291 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2022-07-20 04:14:21,292 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2022-07-20 04:14:21,292 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2022-07-20 04:14:21,292 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2022-07-20 04:14:21,292 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2022-07-20 04:14:21,293 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2022-07-20 04:14:21,293 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2022-07-20 04:14:21,293 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2022-07-20 04:14:21,294 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2022-07-20 04:14:21,294 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2022-07-20 04:14:21,294 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2022-07-20 04:14:21,295 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2022-07-20 04:14:21,295 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2022-07-20 04:14:21,295 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2022-07-20 04:14:21,295 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2022-07-20 04:14:21,296 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2022-07-20 04:14:21,297 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2022-07-20 04:14:21,297 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2022-07-20 04:14:21,298 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2022-07-20 04:14:21,298 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2022-07-20 04:14:21,298 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2022-07-20 04:14:21,298 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2022-07-20 04:14:21,299 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2022-07-20 04:14:21,299 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2022-07-20 04:14:21,300 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2022-07-20 04:14:21,300 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2022-07-20 04:14:21,300 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2022-07-20 04:14:21,300 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2022-07-20 04:14:21,301 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2022-07-20 04:14:21,302 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2022-07-20 04:14:21,302 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2022-07-20 04:14:21,302 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2022-07-20 04:14:21,303 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2022-07-20 04:14:21,303 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2022-07-20 04:14:21,303 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2022-07-20 04:14:21,303 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2022-07-20 04:14:21,304 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2022-07-20 04:14:21,304 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2022-07-20 04:14:21,305 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2022-07-20 04:14:21,306 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2022-07-20 04:14:21,308 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2022-07-20 04:14:21,308 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2022-07-20 04:14:21,308 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2022-07-20 04:14:21,308 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2022-07-20 04:14:21,310 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2022-07-20 04:14:21,313 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2022-07-20 04:14:21,313 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2022-07-20 04:14:21,314 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2022-07-20 04:14:21,314 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2022-07-20 04:14:21,319 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2022-07-20 04:14:21,320 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2022-07-20 04:14:21,320 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2022-07-20 04:14:21,320 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2022-07-20 04:14:21,320 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2022-07-20 04:14:21,321 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2022-07-20 04:14:21,322 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2022-07-20 04:14:21,322 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2022-07-20 04:14:21,322 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2022-07-20 04:14:21,323 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2022-07-20 04:14:21,323 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2022-07-20 04:14:21,324 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2022-07-20 04:14:21,324 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2022-07-20 04:14:21,324 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2022-07-20 04:14:21,324 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2022-07-20 04:14:21,325 WARN L230 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-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2022-07-20 04:14:21,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:14:21,438 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:14:21,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21 WrapperNode [2022-07-20 04:14:21,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:14:21,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:14:21,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:14:21,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:14:21,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,606 INFO L137 Inliner]: procedures = 571, calls = 1726, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2543 [2022-07-20 04:14:21,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:14:21,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:14:21,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:14:21,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:14:21,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:14:21,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:14:21,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:14:21,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:14:21,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (1/1) ... [2022-07-20 04:14:21,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:14:21,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:21,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 04:14:21,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 04:14:21,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:14:21,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:14:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-20 04:14:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-20 04:14:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:14:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:14:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:14:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:14:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-20 04:14:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-20 04:14:21,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:14:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:14:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-20 04:14:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-20 04:14:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:14:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:14:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:14:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:14:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2022-07-20 04:14:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2022-07-20 04:14:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:14:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:14:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2022-07-20 04:14:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2022-07-20 04:14:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:14:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:14:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:14:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:14:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:14:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-20 04:14:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-20 04:14:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 04:14:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 04:14:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:14:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:14:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2022-07-20 04:14:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2022-07-20 04:14:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-20 04:14:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-20 04:14:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-20 04:14:21,842 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:14:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:14:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:14:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:14:21,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:14:21,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:14:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:14:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:14:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:14:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:14:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 04:14:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 04:14:21,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:14:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:14:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-20 04:14:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-20 04:14:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-20 04:14:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-20 04:14:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-20 04:14:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-20 04:14:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:14:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:14:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 04:14:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 04:14:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:14:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:14:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2022-07-20 04:14:21,848 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-20 04:14:21,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:14:21,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:14:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:14:21,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:14:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:14:21,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:14:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2022-07-20 04:14:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:14:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-20 04:14:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-20 04:14:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:14:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:14:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 04:14:21,852 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:14:21,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:14:21,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:14:21,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:14:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 04:14:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:14:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2022-07-20 04:14:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:14:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:14:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 04:14:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 04:14:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-20 04:14:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-20 04:14:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:14:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:14:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:14:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:14:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2022-07-20 04:14:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2022-07-20 04:14:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:14:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:14:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:14:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:14:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:14:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 04:14:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:14:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2022-07-20 04:14:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:14:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:14:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:14:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:14:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2022-07-20 04:14:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2022-07-20 04:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-20 04:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-20 04:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:14:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:14:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:14:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2022-07-20 04:14:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2022-07-20 04:14:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:14:22,268 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:14:22,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:14:22,384 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:14:24,173 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:14:24,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:14:24,184 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 04:14:24,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:14:24 BoogieIcfgContainer [2022-07-20 04:14:24,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:14:24,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:14:24,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:14:24,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:14:24,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:14:19" (1/3) ... [2022-07-20 04:14:24,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8f746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:14:24, skipping insertion in model container [2022-07-20 04:14:24,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:14:21" (2/3) ... [2022-07-20 04:14:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee8f746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:14:24, skipping insertion in model container [2022-07-20 04:14:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:14:24" (3/3) ... [2022-07-20 04:14:24,199 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2022-07-20 04:14:24,208 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:14:24,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-20 04:14:24,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:14:24,279 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37712424, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@343998a1 [2022-07-20 04:14:24,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-20 04:14:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 1033 states, 682 states have (on average 1.312316715542522) internal successors, (895), 723 states have internal predecessors, (895), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) [2022-07-20 04:14:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 04:14:24,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:24,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-20 04:14:24,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:24,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash -103879935, now seen corresponding path program 1 times [2022-07-20 04:14:24,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:24,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130434174] [2022-07-20 04:14:24,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:24,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:24,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:24,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130434174] [2022-07-20 04:14:24,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130434174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:24,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:24,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27263138] [2022-07-20 04:14:24,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:24,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:24,777 INFO L87 Difference]: Start difference. First operand has 1033 states, 682 states have (on average 1.312316715542522) internal successors, (895), 723 states have internal predecessors, (895), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:14:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:27,521 INFO L93 Difference]: Finished difference Result 3027 states and 4220 transitions. [2022-07-20 04:14:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:14:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-20 04:14:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:27,553 INFO L225 Difference]: With dead ends: 3027 [2022-07-20 04:14:27,553 INFO L226 Difference]: Without dead ends: 2000 [2022-07-20 04:14:27,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:14:27,564 INFO L413 NwaCegarLoop]: 1608 mSDtfsCounter, 2622 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 1418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 4052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:27,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2761 Valid, 3934 Invalid, 4052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1418 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 04:14:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2022-07-20 04:14:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1807. [2022-07-20 04:14:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1215 states have (on average 1.242798353909465) internal successors, (1510), 1270 states have internal predecessors, (1510), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2395 transitions. [2022-07-20 04:14:27,695 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2395 transitions. Word has length 64 [2022-07-20 04:14:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:27,695 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 2395 transitions. [2022-07-20 04:14:27,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 04:14:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2395 transitions. [2022-07-20 04:14:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 04:14:27,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:27,697 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2022-07-20 04:14:27,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:14:27,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash 447709296, now seen corresponding path program 1 times [2022-07-20 04:14:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:27,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882210221] [2022-07-20 04:14:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:27,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882210221] [2022-07-20 04:14:27,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882210221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:27,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:27,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880123509] [2022-07-20 04:14:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:27,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:27,868 INFO L87 Difference]: Start difference. First operand 1807 states and 2395 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:14:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:29,183 INFO L93 Difference]: Finished difference Result 1807 states and 2395 transitions. [2022-07-20 04:14:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-20 04:14:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:29,191 INFO L225 Difference]: With dead ends: 1807 [2022-07-20 04:14:29,192 INFO L226 Difference]: Without dead ends: 1805 [2022-07-20 04:14:29,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:29,193 INFO L413 NwaCegarLoop]: 1223 mSDtfsCounter, 1819 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:29,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1959 Valid, 2565 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 04:14:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-20 04:14:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2022-07-20 04:14:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1214 states have (on average 1.242174629324547) internal successors, (1508), 1268 states have internal predecessors, (1508), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2393 transitions. [2022-07-20 04:14:29,241 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2393 transitions. Word has length 70 [2022-07-20 04:14:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:29,241 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 2393 transitions. [2022-07-20 04:14:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 04:14:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2393 transitions. [2022-07-20 04:14:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 04:14:29,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:29,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:29,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:14:29,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1019159084, now seen corresponding path program 1 times [2022-07-20 04:14:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064013719] [2022-07-20 04:14:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:29,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064013719] [2022-07-20 04:14:29,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064013719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:29,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:29,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352850438] [2022-07-20 04:14:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:29,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:29,373 INFO L87 Difference]: Start difference. First operand 1805 states and 2393 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:14:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:30,655 INFO L93 Difference]: Finished difference Result 1805 states and 2393 transitions. [2022-07-20 04:14:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-20 04:14:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:30,663 INFO L225 Difference]: With dead ends: 1805 [2022-07-20 04:14:30,663 INFO L226 Difference]: Without dead ends: 1803 [2022-07-20 04:14:30,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:30,664 INFO L413 NwaCegarLoop]: 1221 mSDtfsCounter, 1813 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:30,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 2563 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 04:14:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-20 04:14:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2022-07-20 04:14:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1213 states have (on average 1.2415498763396537) internal successors, (1506), 1266 states have internal predecessors, (1506), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2391 transitions. [2022-07-20 04:14:30,715 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2391 transitions. Word has length 76 [2022-07-20 04:14:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:30,716 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2391 transitions. [2022-07-20 04:14:30,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 04:14:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2391 transitions. [2022-07-20 04:14:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 04:14:30,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:30,721 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:14:30,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1787508714, now seen corresponding path program 1 times [2022-07-20 04:14:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795408805] [2022-07-20 04:14:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:30,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795408805] [2022-07-20 04:14:30,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795408805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:30,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:30,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051553763] [2022-07-20 04:14:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:30,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:30,950 INFO L87 Difference]: Start difference. First operand 1803 states and 2391 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:14:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:32,245 INFO L93 Difference]: Finished difference Result 1803 states and 2391 transitions. [2022-07-20 04:14:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-20 04:14:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:32,254 INFO L225 Difference]: With dead ends: 1803 [2022-07-20 04:14:32,254 INFO L226 Difference]: Without dead ends: 1801 [2022-07-20 04:14:32,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:32,257 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 1807 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:32,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2561 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 04:14:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-07-20 04:14:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2022-07-20 04:14:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1212 states have (on average 1.2409240924092408) internal successors, (1504), 1264 states have internal predecessors, (1504), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2389 transitions. [2022-07-20 04:14:32,309 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2389 transitions. Word has length 82 [2022-07-20 04:14:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:32,310 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2389 transitions. [2022-07-20 04:14:32,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 04:14:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2389 transitions. [2022-07-20 04:14:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 04:14:32,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:32,311 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:32,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:14:32,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1830124668, now seen corresponding path program 1 times [2022-07-20 04:14:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:32,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115433695] [2022-07-20 04:14:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:32,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115433695] [2022-07-20 04:14:32,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115433695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:32,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:32,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825470220] [2022-07-20 04:14:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:32,467 INFO L87 Difference]: Start difference. First operand 1801 states and 2389 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:33,753 INFO L93 Difference]: Finished difference Result 1801 states and 2389 transitions. [2022-07-20 04:14:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-20 04:14:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:33,760 INFO L225 Difference]: With dead ends: 1801 [2022-07-20 04:14:33,760 INFO L226 Difference]: Without dead ends: 1799 [2022-07-20 04:14:33,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:33,762 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 1801 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:33,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 2559 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 04:14:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-07-20 04:14:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-07-20 04:14:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1211 states have (on average 1.240297274979356) internal successors, (1502), 1262 states have internal predecessors, (1502), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2387 transitions. [2022-07-20 04:14:33,807 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2387 transitions. Word has length 88 [2022-07-20 04:14:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:33,808 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2387 transitions. [2022-07-20 04:14:33,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2387 transitions. [2022-07-20 04:14:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-20 04:14:33,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:33,812 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 04:14:33,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:14:33,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash -419326057, now seen corresponding path program 1 times [2022-07-20 04:14:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529231033] [2022-07-20 04:14:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:14:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 04:14:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:34,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529231033] [2022-07-20 04:14:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529231033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:34,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:34,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:14:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264109911] [2022-07-20 04:14:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:34,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:14:34,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:14:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:14:34,008 INFO L87 Difference]: Start difference. First operand 1799 states and 2387 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:36,179 INFO L93 Difference]: Finished difference Result 3691 states and 4926 transitions. [2022-07-20 04:14:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:14:36,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2022-07-20 04:14:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:36,192 INFO L225 Difference]: With dead ends: 3691 [2022-07-20 04:14:36,193 INFO L226 Difference]: Without dead ends: 1913 [2022-07-20 04:14:36,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-20 04:14:36,199 INFO L413 NwaCegarLoop]: 1211 mSDtfsCounter, 2093 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 4581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:36,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 4047 Invalid, 4581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:14:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-07-20 04:14:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1817. [2022-07-20 04:14:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1223 states have (on average 1.2363041700735895) internal successors, (1512), 1274 states have internal predecessors, (1512), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2397 transitions. [2022-07-20 04:14:36,254 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2397 transitions. Word has length 116 [2022-07-20 04:14:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:36,255 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2397 transitions. [2022-07-20 04:14:36,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2397 transitions. [2022-07-20 04:14:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-20 04:14:36,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:36,257 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 04:14:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:14:36,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash -419266475, now seen corresponding path program 1 times [2022-07-20 04:14:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:36,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082360065] [2022-07-20 04:14:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:14:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 04:14:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:36,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082360065] [2022-07-20 04:14:36,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082360065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:36,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:36,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:14:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271911753] [2022-07-20 04:14:36,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:36,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:14:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:14:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:14:36,450 INFO L87 Difference]: Start difference. First operand 1817 states and 2397 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 04:14:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:38,122 INFO L93 Difference]: Finished difference Result 1913 states and 2550 transitions. [2022-07-20 04:14:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:14:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2022-07-20 04:14:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:38,130 INFO L225 Difference]: With dead ends: 1913 [2022-07-20 04:14:38,130 INFO L226 Difference]: Without dead ends: 1911 [2022-07-20 04:14:38,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:14:38,132 INFO L413 NwaCegarLoop]: 1208 mSDtfsCounter, 1262 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:38,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 3486 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 04:14:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-07-20 04:14:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1815. [2022-07-20 04:14:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1222 states have (on average 1.234860883797054) internal successors, (1509), 1272 states have internal predecessors, (1509), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2394 transitions. [2022-07-20 04:14:38,187 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2394 transitions. Word has length 116 [2022-07-20 04:14:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:38,187 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2394 transitions. [2022-07-20 04:14:38,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 04:14:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2394 transitions. [2022-07-20 04:14:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 04:14:38,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:38,189 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:38,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:14:38,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1080066150, now seen corresponding path program 1 times [2022-07-20 04:14:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:38,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053848473] [2022-07-20 04:14:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:38,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:38,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053848473] [2022-07-20 04:14:38,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053848473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:38,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:38,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942838025] [2022-07-20 04:14:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:38,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:38,379 INFO L87 Difference]: Start difference. First operand 1815 states and 2394 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:14:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:39,567 INFO L93 Difference]: Finished difference Result 1815 states and 2394 transitions. [2022-07-20 04:14:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-20 04:14:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:39,575 INFO L225 Difference]: With dead ends: 1815 [2022-07-20 04:14:39,575 INFO L226 Difference]: Without dead ends: 1813 [2022-07-20 04:14:39,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:39,576 INFO L413 NwaCegarLoop]: 1212 mSDtfsCounter, 1786 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:39,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 2554 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-07-20 04:14:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-07-20 04:14:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1221 states have (on average 1.2342342342342343) internal successors, (1507), 1270 states have internal predecessors, (1507), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2392 transitions. [2022-07-20 04:14:39,639 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2392 transitions. Word has length 94 [2022-07-20 04:14:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:39,639 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2392 transitions. [2022-07-20 04:14:39,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 04:14:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2392 transitions. [2022-07-20 04:14:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:14:39,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:39,643 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-20 04:14:39,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:14:39,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1369630181, now seen corresponding path program 1 times [2022-07-20 04:14:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:39,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667414256] [2022-07-20 04:14:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:14:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 04:14:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:39,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667414256] [2022-07-20 04:14:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667414256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:39,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:39,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356258203] [2022-07-20 04:14:39,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:39,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:39,814 INFO L87 Difference]: Start difference. First operand 1813 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:41,007 INFO L93 Difference]: Finished difference Result 3695 states and 4917 transitions. [2022-07-20 04:14:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-07-20 04:14:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:41,014 INFO L225 Difference]: With dead ends: 3695 [2022-07-20 04:14:41,014 INFO L226 Difference]: Without dead ends: 1903 [2022-07-20 04:14:41,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:41,019 INFO L413 NwaCegarLoop]: 1202 mSDtfsCounter, 2184 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1321 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:41,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 2380 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1321 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-07-20 04:14:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1807. [2022-07-20 04:14:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1216 states have (on average 1.231907894736842) internal successors, (1498), 1264 states have internal predecessors, (1498), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2383 transitions. [2022-07-20 04:14:41,075 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2383 transitions. Word has length 120 [2022-07-20 04:14:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:41,075 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 2383 transitions. [2022-07-20 04:14:41,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 04:14:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2383 transitions. [2022-07-20 04:14:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 04:14:41,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:41,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:41,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:14:41,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1666453260, now seen corresponding path program 1 times [2022-07-20 04:14:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:41,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297468982] [2022-07-20 04:14:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297468982] [2022-07-20 04:14:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297468982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:41,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382313810] [2022-07-20 04:14:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:41,192 INFO L87 Difference]: Start difference. First operand 1807 states and 2383 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:14:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:42,373 INFO L93 Difference]: Finished difference Result 1807 states and 2383 transitions. [2022-07-20 04:14:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:42,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-20 04:14:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:42,379 INFO L225 Difference]: With dead ends: 1807 [2022-07-20 04:14:42,379 INFO L226 Difference]: Without dead ends: 1805 [2022-07-20 04:14:42,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:42,380 INFO L413 NwaCegarLoop]: 1205 mSDtfsCounter, 1765 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:42,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 2547 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-07-20 04:14:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2022-07-20 04:14:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1215 states have (on average 1.231275720164609) internal successors, (1496), 1262 states have internal predecessors, (1496), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2381 transitions. [2022-07-20 04:14:42,455 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2381 transitions. Word has length 100 [2022-07-20 04:14:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:42,457 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 2381 transitions. [2022-07-20 04:14:42,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 04:14:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2381 transitions. [2022-07-20 04:14:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 04:14:42,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:42,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:42,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:14:42,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1294274607, now seen corresponding path program 1 times [2022-07-20 04:14:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:42,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001501884] [2022-07-20 04:14:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:42,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001501884] [2022-07-20 04:14:42,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001501884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:42,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:42,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695004986] [2022-07-20 04:14:42,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:42,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:42,573 INFO L87 Difference]: Start difference. First operand 1805 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:14:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:43,751 INFO L93 Difference]: Finished difference Result 1805 states and 2381 transitions. [2022-07-20 04:14:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-20 04:14:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:43,758 INFO L225 Difference]: With dead ends: 1805 [2022-07-20 04:14:43,758 INFO L226 Difference]: Without dead ends: 1803 [2022-07-20 04:14:43,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:43,759 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1763 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:43,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2545 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-20 04:14:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2022-07-20 04:14:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1214 states have (on average 1.2306425041186162) internal successors, (1494), 1260 states have internal predecessors, (1494), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2379 transitions. [2022-07-20 04:14:43,835 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2379 transitions. Word has length 106 [2022-07-20 04:14:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:43,835 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2379 transitions. [2022-07-20 04:14:43,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:14:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2379 transitions. [2022-07-20 04:14:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 04:14:43,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:43,836 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:43,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:14:43,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1742479118, now seen corresponding path program 1 times [2022-07-20 04:14:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827600080] [2022-07-20 04:14:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827600080] [2022-07-20 04:14:43,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827600080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:43,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:43,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439763368] [2022-07-20 04:14:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:43,950 INFO L87 Difference]: Start difference. First operand 1803 states and 2379 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:14:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:45,132 INFO L93 Difference]: Finished difference Result 1803 states and 2379 transitions. [2022-07-20 04:14:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-20 04:14:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:45,139 INFO L225 Difference]: With dead ends: 1803 [2022-07-20 04:14:45,139 INFO L226 Difference]: Without dead ends: 1801 [2022-07-20 04:14:45,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:45,140 INFO L413 NwaCegarLoop]: 1201 mSDtfsCounter, 1751 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:45,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 2543 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-07-20 04:14:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2022-07-20 04:14:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1213 states have (on average 1.2300082440230833) internal successors, (1492), 1258 states have internal predecessors, (1492), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2377 transitions. [2022-07-20 04:14:45,200 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2377 transitions. Word has length 108 [2022-07-20 04:14:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:45,200 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 2377 transitions. [2022-07-20 04:14:45,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-20 04:14:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2377 transitions. [2022-07-20 04:14:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 04:14:45,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:45,202 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:45,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:14:45,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1663050078, now seen corresponding path program 1 times [2022-07-20 04:14:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:45,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135695311] [2022-07-20 04:14:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:45,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:45,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135695311] [2022-07-20 04:14:45,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135695311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:45,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:45,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620917680] [2022-07-20 04:14:45,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:45,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:45,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:45,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:45,349 INFO L87 Difference]: Start difference. First operand 1801 states and 2377 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:14:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:46,577 INFO L93 Difference]: Finished difference Result 1801 states and 2377 transitions. [2022-07-20 04:14:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-20 04:14:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:46,584 INFO L225 Difference]: With dead ends: 1801 [2022-07-20 04:14:46,584 INFO L226 Difference]: Without dead ends: 1799 [2022-07-20 04:14:46,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:46,585 INFO L413 NwaCegarLoop]: 1199 mSDtfsCounter, 1747 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:46,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 2541 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-07-20 04:14:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-07-20 04:14:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1212 states have (on average 1.2293729372937294) internal successors, (1490), 1256 states have internal predecessors, (1490), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2375 transitions. [2022-07-20 04:14:46,651 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2375 transitions. Word has length 114 [2022-07-20 04:14:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:46,652 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2375 transitions. [2022-07-20 04:14:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 04:14:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2375 transitions. [2022-07-20 04:14:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:14:46,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:46,653 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:46,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:14:46,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1402453942, now seen corresponding path program 1 times [2022-07-20 04:14:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073097569] [2022-07-20 04:14:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073097569] [2022-07-20 04:14:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073097569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:46,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:46,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180901625] [2022-07-20 04:14:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:46,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:46,783 INFO L87 Difference]: Start difference. First operand 1799 states and 2375 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:14:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:47,944 INFO L93 Difference]: Finished difference Result 1799 states and 2375 transitions. [2022-07-20 04:14:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:47,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-20 04:14:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:47,950 INFO L225 Difference]: With dead ends: 1799 [2022-07-20 04:14:47,950 INFO L226 Difference]: Without dead ends: 1797 [2022-07-20 04:14:47,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:47,951 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1741 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:47,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 2539 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2022-07-20 04:14:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1797. [2022-07-20 04:14:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1211 states have (on average 1.2287365813377373) internal successors, (1488), 1254 states have internal predecessors, (1488), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2373 transitions. [2022-07-20 04:14:48,011 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2373 transitions. Word has length 120 [2022-07-20 04:14:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:48,011 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2373 transitions. [2022-07-20 04:14:48,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:14:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2373 transitions. [2022-07-20 04:14:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 04:14:48,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:48,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:14:48,013 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1949626691, now seen corresponding path program 1 times [2022-07-20 04:14:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236595833] [2022-07-20 04:14:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236595833] [2022-07-20 04:14:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236595833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:48,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:48,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672809729] [2022-07-20 04:14:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:48,173 INFO L87 Difference]: Start difference. First operand 1797 states and 2373 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:14:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:49,400 INFO L93 Difference]: Finished difference Result 1797 states and 2373 transitions. [2022-07-20 04:14:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-20 04:14:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:49,407 INFO L225 Difference]: With dead ends: 1797 [2022-07-20 04:14:49,407 INFO L226 Difference]: Without dead ends: 1795 [2022-07-20 04:14:49,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:49,408 INFO L413 NwaCegarLoop]: 1195 mSDtfsCounter, 1735 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:49,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 2537 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-07-20 04:14:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2022-07-20 04:14:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1210 states have (on average 1.228099173553719) internal successors, (1486), 1252 states have internal predecessors, (1486), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2371 transitions. [2022-07-20 04:14:49,483 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2371 transitions. Word has length 126 [2022-07-20 04:14:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:49,483 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2371 transitions. [2022-07-20 04:14:49,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:14:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2371 transitions. [2022-07-20 04:14:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-20 04:14:49,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:49,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:49,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:14:49,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1159748716, now seen corresponding path program 1 times [2022-07-20 04:14:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:49,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57912201] [2022-07-20 04:14:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:14:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-20 04:14:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:49,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57912201] [2022-07-20 04:14:49,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57912201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:49,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:49,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:14:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383926637] [2022-07-20 04:14:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:49,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:14:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:14:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:14:49,628 INFO L87 Difference]: Start difference. First operand 1795 states and 2371 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:14:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:50,896 INFO L93 Difference]: Finished difference Result 3665 states and 4865 transitions. [2022-07-20 04:14:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:50,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2022-07-20 04:14:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:50,903 INFO L225 Difference]: With dead ends: 3665 [2022-07-20 04:14:50,903 INFO L226 Difference]: Without dead ends: 1891 [2022-07-20 04:14:50,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:50,907 INFO L413 NwaCegarLoop]: 1031 mSDtfsCounter, 2468 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:50,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 2193 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-07-20 04:14:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1789. [2022-07-20 04:14:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1205 states have (on average 1.2257261410788383) internal successors, (1477), 1246 states have internal predecessors, (1477), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2362 transitions. [2022-07-20 04:14:51,010 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2362 transitions. Word has length 149 [2022-07-20 04:14:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:51,011 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2362 transitions. [2022-07-20 04:14:51,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-20 04:14:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2362 transitions. [2022-07-20 04:14:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 04:14:51,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:51,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:51,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:14:51,013 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1652311080, now seen corresponding path program 1 times [2022-07-20 04:14:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:51,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978726236] [2022-07-20 04:14:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978726236] [2022-07-20 04:14:51,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978726236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:51,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:51,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140542029] [2022-07-20 04:14:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:51,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:51,153 INFO L87 Difference]: Start difference. First operand 1789 states and 2362 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:14:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:52,363 INFO L93 Difference]: Finished difference Result 1789 states and 2362 transitions. [2022-07-20 04:14:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-20 04:14:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:52,369 INFO L225 Difference]: With dead ends: 1789 [2022-07-20 04:14:52,369 INFO L226 Difference]: Without dead ends: 1787 [2022-07-20 04:14:52,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:52,370 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 1724 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:52,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 2516 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2022-07-20 04:14:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1787. [2022-07-20 04:14:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1204 states have (on average 1.2250830564784052) internal successors, (1475), 1244 states have internal predecessors, (1475), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2360 transitions. [2022-07-20 04:14:52,438 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2360 transitions. Word has length 132 [2022-07-20 04:14:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:52,438 INFO L495 AbstractCegarLoop]: Abstraction has 1787 states and 2360 transitions. [2022-07-20 04:14:52,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-20 04:14:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2360 transitions. [2022-07-20 04:14:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-20 04:14:52,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:52,440 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:52,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:14:52,440 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2146398211, now seen corresponding path program 1 times [2022-07-20 04:14:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:52,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810938394] [2022-07-20 04:14:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:14:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 04:14:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-20 04:14:52,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810938394] [2022-07-20 04:14:52,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810938394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:14:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743086432] [2022-07-20 04:14:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:52,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:52,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:52,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:14:52,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 04:14:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:14:53,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-20 04:14:53,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:14:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743086432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:53,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:14:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 04:14:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802765502] [2022-07-20 04:14:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:53,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:14:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:14:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:53,312 INFO L87 Difference]: Start difference. First operand 1787 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:14:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:53,412 INFO L93 Difference]: Finished difference Result 3547 states and 4682 transitions. [2022-07-20 04:14:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:14:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-20 04:14:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:53,419 INFO L225 Difference]: With dead ends: 3547 [2022-07-20 04:14:53,419 INFO L226 Difference]: Without dead ends: 1781 [2022-07-20 04:14:53,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:53,426 INFO L413 NwaCegarLoop]: 1280 mSDtfsCounter, 1225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:53,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1280 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:14:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-07-20 04:14:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2022-07-20 04:14:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1199 states have (on average 1.2226855713094245) internal successors, (1466), 1238 states have internal predecessors, (1466), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2351 transitions. [2022-07-20 04:14:53,523 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2351 transitions. Word has length 155 [2022-07-20 04:14:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:53,524 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2351 transitions. [2022-07-20 04:14:53,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-20 04:14:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2351 transitions. [2022-07-20 04:14:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 04:14:53,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:53,525 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:53,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 04:14:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 04:14:53,741 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -158589524, now seen corresponding path program 1 times [2022-07-20 04:14:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692402071] [2022-07-20 04:14:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692402071] [2022-07-20 04:14:53,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692402071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:53,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:53,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857892743] [2022-07-20 04:14:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:53,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:53,925 INFO L87 Difference]: Start difference. First operand 1781 states and 2351 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:14:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:55,420 INFO L93 Difference]: Finished difference Result 1781 states and 2351 transitions. [2022-07-20 04:14:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-20 04:14:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:55,425 INFO L225 Difference]: With dead ends: 1781 [2022-07-20 04:14:55,425 INFO L226 Difference]: Without dead ends: 1779 [2022-07-20 04:14:55,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:55,426 INFO L413 NwaCegarLoop]: 1181 mSDtfsCounter, 1713 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:55,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 2495 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 04:14:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-07-20 04:14:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-07-20 04:14:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1198 states have (on average 1.2220367278797997) internal successors, (1464), 1236 states have internal predecessors, (1464), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2349 transitions. [2022-07-20 04:14:55,502 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2349 transitions. Word has length 138 [2022-07-20 04:14:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:55,502 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2349 transitions. [2022-07-20 04:14:55,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 04:14:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2349 transitions. [2022-07-20 04:14:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 04:14:55,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:55,504 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:55,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:14:55,504 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -362451879, now seen corresponding path program 1 times [2022-07-20 04:14:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444069380] [2022-07-20 04:14:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:14:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:55,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444069380] [2022-07-20 04:14:55,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444069380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:55,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:55,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122041619] [2022-07-20 04:14:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:55,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:55,719 INFO L87 Difference]: Start difference. First operand 1779 states and 2349 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:14:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:56,936 INFO L93 Difference]: Finished difference Result 1779 states and 2349 transitions. [2022-07-20 04:14:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-20 04:14:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:56,942 INFO L225 Difference]: With dead ends: 1779 [2022-07-20 04:14:56,942 INFO L226 Difference]: Without dead ends: 1777 [2022-07-20 04:14:56,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:56,943 INFO L413 NwaCegarLoop]: 1179 mSDtfsCounter, 1707 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:56,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 2493 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-07-20 04:14:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2022-07-20 04:14:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1197 states have (on average 1.2213868003341688) internal successors, (1462), 1234 states have internal predecessors, (1462), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2347 transitions. [2022-07-20 04:14:57,034 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2347 transitions. Word has length 144 [2022-07-20 04:14:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:57,035 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 2347 transitions. [2022-07-20 04:14:57,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 04:14:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2347 transitions. [2022-07-20 04:14:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 04:14:57,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:57,036 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:57,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:14:57,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1691986718, now seen corresponding path program 1 times [2022-07-20 04:14:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:57,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818271751] [2022-07-20 04:14:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:14:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:14:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818271751] [2022-07-20 04:14:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818271751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:57,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:57,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301412855] [2022-07-20 04:14:57,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:57,178 INFO L87 Difference]: Start difference. First operand 1777 states and 2347 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:14:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:58,379 INFO L93 Difference]: Finished difference Result 1777 states and 2347 transitions. [2022-07-20 04:14:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-20 04:14:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:58,384 INFO L225 Difference]: With dead ends: 1777 [2022-07-20 04:14:58,384 INFO L226 Difference]: Without dead ends: 1775 [2022-07-20 04:14:58,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:58,385 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1701 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:58,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 2491 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:14:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-20 04:14:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2022-07-20 04:14:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1196 states have (on average 1.2207357859531773) internal successors, (1460), 1232 states have internal predecessors, (1460), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2345 transitions. [2022-07-20 04:14:58,457 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2345 transitions. Word has length 150 [2022-07-20 04:14:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:58,458 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2345 transitions. [2022-07-20 04:14:58,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 04:14:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2345 transitions. [2022-07-20 04:14:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-20 04:14:58,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:58,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:14:58,460 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 735405847, now seen corresponding path program 1 times [2022-07-20 04:14:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420332491] [2022-07-20 04:14:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:14:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:14:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:14:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:58,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420332491] [2022-07-20 04:14:58,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420332491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:58,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:58,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661394821] [2022-07-20 04:14:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:58,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:58,611 INFO L87 Difference]: Start difference. First operand 1775 states and 2345 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 04:14:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:59,771 INFO L93 Difference]: Finished difference Result 1775 states and 2345 transitions. [2022-07-20 04:14:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-20 04:14:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:59,775 INFO L225 Difference]: With dead ends: 1775 [2022-07-20 04:14:59,775 INFO L226 Difference]: Without dead ends: 1773 [2022-07-20 04:14:59,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:14:59,776 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 1695 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:59,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 2489 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 04:14:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-07-20 04:14:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2022-07-20 04:14:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1195 states have (on average 1.2200836820083683) internal successors, (1458), 1230 states have internal predecessors, (1458), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:14:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2343 transitions. [2022-07-20 04:14:59,851 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2343 transitions. Word has length 156 [2022-07-20 04:14:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:59,852 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2343 transitions. [2022-07-20 04:14:59,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-20 04:14:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2343 transitions. [2022-07-20 04:14:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 04:14:59,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:59,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:14:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:14:59,854 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:14:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -602093927, now seen corresponding path program 1 times [2022-07-20 04:14:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048630946] [2022-07-20 04:14:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:14:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:14:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:14:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:14:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:14:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:14:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:14:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:14:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:14:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:14:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:14:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:14:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:14:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:14:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:14:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:14:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:14:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:59,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048630946] [2022-07-20 04:14:59,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048630946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:59,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:59,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242863449] [2022-07-20 04:14:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:59,987 INFO L87 Difference]: Start difference. First operand 1773 states and 2343 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:15:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:01,258 INFO L93 Difference]: Finished difference Result 1773 states and 2343 transitions. [2022-07-20 04:15:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-20 04:15:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:01,263 INFO L225 Difference]: With dead ends: 1773 [2022-07-20 04:15:01,263 INFO L226 Difference]: Without dead ends: 1771 [2022-07-20 04:15:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:01,264 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1689 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:01,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 2487 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:15:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-20 04:15:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2022-07-20 04:15:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1194 states have (on average 1.219430485762144) internal successors, (1456), 1228 states have internal predecessors, (1456), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:15:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2341 transitions. [2022-07-20 04:15:01,344 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2341 transitions. Word has length 162 [2022-07-20 04:15:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:01,345 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2341 transitions. [2022-07-20 04:15:01,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 04:15:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2341 transitions. [2022-07-20 04:15:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:15:01,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:01,347 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:01,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:15:01,347 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1976939342, now seen corresponding path program 1 times [2022-07-20 04:15:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:01,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699127846] [2022-07-20 04:15:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:15:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:15:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:15:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:15:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:15:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:15:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:15:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:15:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:15:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:15:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:15:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:15:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:15:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:15:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:15:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:15:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:15:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:15:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699127846] [2022-07-20 04:15:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699127846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:01,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:01,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197293479] [2022-07-20 04:15:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:01,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:01,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:01,512 INFO L87 Difference]: Start difference. First operand 1771 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:15:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:02,997 INFO L93 Difference]: Finished difference Result 1771 states and 2341 transitions. [2022-07-20 04:15:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-20 04:15:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:03,002 INFO L225 Difference]: With dead ends: 1771 [2022-07-20 04:15:03,002 INFO L226 Difference]: Without dead ends: 1769 [2022-07-20 04:15:03,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:03,004 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1683 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:03,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2485 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 04:15:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-07-20 04:15:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-07-20 04:15:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1193 states have (on average 1.2187761944677284) internal successors, (1454), 1226 states have internal predecessors, (1454), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2022-07-20 04:15:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2339 transitions. [2022-07-20 04:15:03,113 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2339 transitions. Word has length 168 [2022-07-20 04:15:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:03,114 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2339 transitions. [2022-07-20 04:15:03,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 04:15:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2339 transitions. [2022-07-20 04:15:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-20 04:15:03,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:03,116 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:03,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:15:03,116 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash 206781077, now seen corresponding path program 1 times [2022-07-20 04:15:03,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:03,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251375400] [2022-07-20 04:15:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:15:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:15:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:15:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:15:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:15:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:15:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 04:15:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-20 04:15:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251375400] [2022-07-20 04:15:03,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251375400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:03,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 04:15:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899069728] [2022-07-20 04:15:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:03,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 04:15:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 04:15:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:15:03,426 INFO L87 Difference]: Start difference. First operand 1769 states and 2339 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-20 04:15:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:11,554 INFO L93 Difference]: Finished difference Result 3023 states and 3986 transitions. [2022-07-20 04:15:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 04:15:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 218 [2022-07-20 04:15:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:11,570 INFO L225 Difference]: With dead ends: 3023 [2022-07-20 04:15:11,570 INFO L226 Difference]: Without dead ends: 3021 [2022-07-20 04:15:11,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 04:15:11,571 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 6488 mSDsluCounter, 6268 mSDsCounter, 0 mSdLazyCounter, 10636 mSolverCounterSat, 5243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6776 SdHoareTripleChecker+Valid, 8509 SdHoareTripleChecker+Invalid, 15879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5243 IncrementalHoareTripleChecker+Valid, 10636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:11,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6776 Valid, 8509 Invalid, 15879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5243 Valid, 10636 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-20 04:15:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-07-20 04:15:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2554. [2022-07-20 04:15:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1729 states have (on average 1.2249855407750145) internal successors, (2118), 1777 states have internal predecessors, (2118), 639 states have call successors, (639), 185 states have call predecessors, (639), 180 states have return successors, (639), 623 states have call predecessors, (639), 637 states have call successors, (639) [2022-07-20 04:15:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3396 transitions. [2022-07-20 04:15:11,699 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3396 transitions. Word has length 218 [2022-07-20 04:15:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:11,700 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3396 transitions. [2022-07-20 04:15:11,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-20 04:15:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3396 transitions. [2022-07-20 04:15:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-20 04:15:11,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:11,702 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:11,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:15:11,702 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -790291276, now seen corresponding path program 1 times [2022-07-20 04:15:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020086855] [2022-07-20 04:15:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:15:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:15:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:15:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:15:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 04:15:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 04:15:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 04:15:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-20 04:15:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020086855] [2022-07-20 04:15:12,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020086855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:15:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902886780] [2022-07-20 04:15:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:12,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:12,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:12,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:12,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:15:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:12,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 04:15:12,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-20 04:15:12,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:15:12,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902886780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:12,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:15:12,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 15 [2022-07-20 04:15:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486953375] [2022-07-20 04:15:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:12,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:15:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:15:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:15:12,662 INFO L87 Difference]: Start difference. First operand 2554 states and 3396 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 04:15:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:13,393 INFO L93 Difference]: Finished difference Result 5417 states and 7251 transitions. [2022-07-20 04:15:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:15:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 218 [2022-07-20 04:15:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:13,412 INFO L225 Difference]: With dead ends: 5417 [2022-07-20 04:15:13,412 INFO L226 Difference]: Without dead ends: 2884 [2022-07-20 04:15:13,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-20 04:15:13,416 INFO L413 NwaCegarLoop]: 1408 mSDtfsCounter, 80 mSDsluCounter, 11115 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 12523 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:13,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 12523 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 04:15:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2022-07-20 04:15:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2587. [2022-07-20 04:15:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 1753 states have (on average 1.221905305191101) internal successors, (2142), 1801 states have internal predecessors, (2142), 642 states have call successors, (642), 185 states have call predecessors, (642), 186 states have return successors, (654), 632 states have call predecessors, (654), 640 states have call successors, (654) [2022-07-20 04:15:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3438 transitions. [2022-07-20 04:15:13,556 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3438 transitions. Word has length 218 [2022-07-20 04:15:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:13,556 INFO L495 AbstractCegarLoop]: Abstraction has 2587 states and 3438 transitions. [2022-07-20 04:15:13,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 04:15:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3438 transitions. [2022-07-20 04:15:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 04:15:13,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:13,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:13,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 04:15:13,771 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -236273954, now seen corresponding path program 1 times [2022-07-20 04:15:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759871373] [2022-07-20 04:15:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:15:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:15:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:15:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:15:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:15:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:15:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:15:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:15:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:15:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:15:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:15:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:15:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:15:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:15:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:15:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:15:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:15:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:15:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:15:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759871373] [2022-07-20 04:15:13,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759871373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:13,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:13,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742849241] [2022-07-20 04:15:13,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:13,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:13,928 INFO L87 Difference]: Start difference. First operand 2587 states and 3438 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:15:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:15,209 INFO L93 Difference]: Finished difference Result 2587 states and 3438 transitions. [2022-07-20 04:15:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-20 04:15:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:15,216 INFO L225 Difference]: With dead ends: 2587 [2022-07-20 04:15:15,216 INFO L226 Difference]: Without dead ends: 2585 [2022-07-20 04:15:15,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:15,217 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1677 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:15,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2483 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:15:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2022-07-20 04:15:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2022-07-20 04:15:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 1752 states have (on average 1.221461187214612) internal successors, (2140), 1799 states have internal predecessors, (2140), 642 states have call successors, (642), 185 states have call predecessors, (642), 186 states have return successors, (654), 632 states have call predecessors, (654), 640 states have call successors, (654) [2022-07-20 04:15:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3436 transitions. [2022-07-20 04:15:15,374 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3436 transitions. Word has length 174 [2022-07-20 04:15:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:15,374 INFO L495 AbstractCegarLoop]: Abstraction has 2585 states and 3436 transitions. [2022-07-20 04:15:15,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 04:15:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3436 transitions. [2022-07-20 04:15:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 04:15:15,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:15,376 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:15,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:15:15,376 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1377744045, now seen corresponding path program 1 times [2022-07-20 04:15:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078601538] [2022-07-20 04:15:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 04:15:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:15:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 04:15:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 04:15:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:15:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:15:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 04:15:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 04:15:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:15:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:15:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:15:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:15:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 04:15:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 04:15:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:15:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 04:15:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 04:15:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 04:15:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:15:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:15:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078601538] [2022-07-20 04:15:15,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078601538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:15,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:15,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943836328] [2022-07-20 04:15:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:15,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:15,511 INFO L87 Difference]: Start difference. First operand 2585 states and 3436 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:15:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:16,742 INFO L93 Difference]: Finished difference Result 2585 states and 3436 transitions. [2022-07-20 04:15:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-20 04:15:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:16,748 INFO L225 Difference]: With dead ends: 2585 [2022-07-20 04:15:16,748 INFO L226 Difference]: Without dead ends: 2410 [2022-07-20 04:15:16,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:16,751 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 1668 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:16,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 2482 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 04:15:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-07-20 04:15:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2022-07-20 04:15:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1647 states have (on average 1.2331511839708562) internal successors, (2031), 1691 states have internal predecessors, (2031), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 585 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-20 04:15:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3229 transitions. [2022-07-20 04:15:16,909 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3229 transitions. Word has length 180 [2022-07-20 04:15:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:16,910 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 3229 transitions. [2022-07-20 04:15:16,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:15:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3229 transitions. [2022-07-20 04:15:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-20 04:15:16,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:16,911 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:16,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 04:15:16,912 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1889934448, now seen corresponding path program 1 times [2022-07-20 04:15:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584267358] [2022-07-20 04:15:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:16,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:16,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666278629] [2022-07-20 04:15:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:16,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:16,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 04:15:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 2242 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 04:15:17,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 174 proven. 3 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-20 04:15:17,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:15:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2022-07-20 04:15:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584267358] [2022-07-20 04:15:18,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666278629] [2022-07-20 04:15:18,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666278629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:15:18,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:15:18,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:15:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157077024] [2022-07-20 04:15:18,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:15:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:15:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:15:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:15:18,240 INFO L87 Difference]: Start difference. First operand 2410 states and 3229 transitions. Second operand has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) [2022-07-20 04:15:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:18,740 INFO L93 Difference]: Finished difference Result 4805 states and 6437 transitions. [2022-07-20 04:15:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:15:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) Word has length 260 [2022-07-20 04:15:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:18,746 INFO L225 Difference]: With dead ends: 4805 [2022-07-20 04:15:18,746 INFO L226 Difference]: Without dead ends: 2410 [2022-07-20 04:15:18,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 505 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:15:18,752 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 761 mSDsluCounter, 8143 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 9228 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:18,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 9228 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:15:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-07-20 04:15:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2022-07-20 04:15:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1647 states have (on average 1.2325440194292654) internal successors, (2030), 1690 states have internal predecessors, (2030), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 585 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-20 04:15:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3228 transitions. [2022-07-20 04:15:18,930 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3228 transitions. Word has length 260 [2022-07-20 04:15:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:18,930 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 3228 transitions. [2022-07-20 04:15:18,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.076923076923077) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (56), 2 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 5 states have call successors, (57) [2022-07-20 04:15:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3228 transitions. [2022-07-20 04:15:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-20 04:15:18,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:18,932 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:18,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:19,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 04:15:19,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -686638520, now seen corresponding path program 1 times [2022-07-20 04:15:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:19,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696665518] [2022-07-20 04:15:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:19,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:19,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308246281] [2022-07-20 04:15:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:19,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:19,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:19,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:19,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 04:15:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:19,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 2188 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 04:15:19,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-07-20 04:15:19,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:15:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696665518] [2022-07-20 04:15:19,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308246281] [2022-07-20 04:15:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308246281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:15:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191133427] [2022-07-20 04:15:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:15:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:19,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:15:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:19,849 INFO L87 Difference]: Start difference. First operand 2410 states and 3228 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-20 04:15:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:21,073 INFO L93 Difference]: Finished difference Result 5038 states and 6771 transitions. [2022-07-20 04:15:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:15:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) Word has length 243 [2022-07-20 04:15:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:21,080 INFO L225 Difference]: With dead ends: 5038 [2022-07-20 04:15:21,080 INFO L226 Difference]: Without dead ends: 2647 [2022-07-20 04:15:21,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:15:21,086 INFO L413 NwaCegarLoop]: 1233 mSDtfsCounter, 80 mSDsluCounter, 9728 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 10961 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:21,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 10961 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 04:15:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2022-07-20 04:15:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2416. [2022-07-20 04:15:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1653 states have (on average 1.2316999395039323) internal successors, (2036), 1693 states have internal predecessors, (2036), 593 states have call successors, (593), 165 states have call predecessors, (593), 166 states have return successors, (605), 588 states have call predecessors, (605), 591 states have call successors, (605) [2022-07-20 04:15:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3234 transitions. [2022-07-20 04:15:21,225 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3234 transitions. Word has length 243 [2022-07-20 04:15:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:21,225 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 3234 transitions. [2022-07-20 04:15:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-20 04:15:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3234 transitions. [2022-07-20 04:15:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-07-20 04:15:21,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:21,227 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:21,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:21,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:21,440 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1119375373, now seen corresponding path program 1 times [2022-07-20 04:15:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:21,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284814673] [2022-07-20 04:15:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:21,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:21,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334146217] [2022-07-20 04:15:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:21,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:21,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 04:15:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 2260 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 04:15:22,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-20 04:15:22,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:15:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:22,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284814673] [2022-07-20 04:15:22,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:22,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334146217] [2022-07-20 04:15:22,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334146217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:22,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:22,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:15:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825973297] [2022-07-20 04:15:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:22,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:15:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:15:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:15:22,177 INFO L87 Difference]: Start difference. First operand 2416 states and 3234 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:15:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:22,390 INFO L93 Difference]: Finished difference Result 5122 states and 6897 transitions. [2022-07-20 04:15:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:15:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) Word has length 264 [2022-07-20 04:15:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:22,395 INFO L225 Difference]: With dead ends: 5122 [2022-07-20 04:15:22,396 INFO L226 Difference]: Without dead ends: 2725 [2022-07-20 04:15:22,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:15:22,400 INFO L413 NwaCegarLoop]: 1250 mSDtfsCounter, 87 mSDsluCounter, 8621 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 9871 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:22,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 9871 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:15:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2022-07-20 04:15:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2443. [2022-07-20 04:15:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1674 states have (on average 1.2287933094384706) internal successors, (2057), 1714 states have internal predecessors, (2057), 593 states have call successors, (593), 165 states have call predecessors, (593), 172 states have return successors, (614), 594 states have call predecessors, (614), 591 states have call successors, (614) [2022-07-20 04:15:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3264 transitions. [2022-07-20 04:15:22,538 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3264 transitions. Word has length 264 [2022-07-20 04:15:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:22,538 INFO L495 AbstractCegarLoop]: Abstraction has 2443 states and 3264 transitions. [2022-07-20 04:15:22,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 04:15:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3264 transitions. [2022-07-20 04:15:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-20 04:15:22,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:22,540 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:22,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:22,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:22,759 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1546746240, now seen corresponding path program 1 times [2022-07-20 04:15:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316061500] [2022-07-20 04:15:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:15:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:15:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:15:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 04:15:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:15:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:15:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:15:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 04:15:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:15:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:15:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-20 04:15:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:22,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316061500] [2022-07-20 04:15:22,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316061500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:22,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:22,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:15:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260546528] [2022-07-20 04:15:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:22,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:15:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:15:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:22,979 INFO L87 Difference]: Start difference. First operand 2443 states and 3264 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:15:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:24,886 INFO L93 Difference]: Finished difference Result 2568 states and 3454 transitions. [2022-07-20 04:15:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 04:15:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 239 [2022-07-20 04:15:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:24,891 INFO L225 Difference]: With dead ends: 2568 [2022-07-20 04:15:24,891 INFO L226 Difference]: Without dead ends: 2566 [2022-07-20 04:15:24,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:15:24,892 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 2113 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:24,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 3134 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1770 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-20 04:15:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-20 04:15:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2459. [2022-07-20 04:15:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1685 states have (on average 1.225519287833828) internal successors, (2065), 1724 states have internal predecessors, (2065), 593 states have call successors, (593), 171 states have call predecessors, (593), 178 states have return successors, (614), 594 states have call predecessors, (614), 591 states have call successors, (614) [2022-07-20 04:15:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3272 transitions. [2022-07-20 04:15:25,031 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3272 transitions. Word has length 239 [2022-07-20 04:15:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:25,031 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3272 transitions. [2022-07-20 04:15:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-20 04:15:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3272 transitions. [2022-07-20 04:15:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-07-20 04:15:25,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:25,033 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:25,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 04:15:25,033 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1468486265, now seen corresponding path program 1 times [2022-07-20 04:15:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:25,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729105112] [2022-07-20 04:15:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:25,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:25,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709594080] [2022-07-20 04:15:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:25,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:25,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:25,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 04:15:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:27,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 04:15:27,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-07-20 04:15:27,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:15:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-07-20 04:15:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729105112] [2022-07-20 04:15:27,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709594080] [2022-07-20 04:15:27,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709594080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:15:27,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:15:27,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-20 04:15:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394195481] [2022-07-20 04:15:27,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:15:27,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:15:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:15:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:15:27,598 INFO L87 Difference]: Start difference. First operand 2459 states and 3272 transitions. Second operand has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-20 04:15:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:27,856 INFO L93 Difference]: Finished difference Result 4586 states and 6057 transitions. [2022-07-20 04:15:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:15:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) Word has length 280 [2022-07-20 04:15:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:27,862 INFO L225 Difference]: With dead ends: 4586 [2022-07-20 04:15:27,862 INFO L226 Difference]: Without dead ends: 2146 [2022-07-20 04:15:27,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:15:27,866 INFO L413 NwaCegarLoop]: 1089 mSDtfsCounter, 15 mSDsluCounter, 6484 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7573 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:27,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7573 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 04:15:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-07-20 04:15:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2144. [2022-07-20 04:15:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1455 states have (on average 1.2) internal successors, (1746), 1490 states have internal predecessors, (1746), 520 states have call successors, (520), 161 states have call predecessors, (520), 166 states have return successors, (537), 520 states have call predecessors, (537), 518 states have call successors, (537) [2022-07-20 04:15:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2803 transitions. [2022-07-20 04:15:27,988 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2803 transitions. Word has length 280 [2022-07-20 04:15:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:27,988 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 2803 transitions. [2022-07-20 04:15:27,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.153846153846153) internal successors, (106), 12 states have internal predecessors, (106), 5 states have call successors, (36), 2 states have call predecessors, (36), 5 states have return successors, (36), 6 states have call predecessors, (36), 5 states have call successors, (36) [2022-07-20 04:15:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2803 transitions. [2022-07-20 04:15:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-20 04:15:27,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:27,990 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:28,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:28,201 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash 122220891, now seen corresponding path program 1 times [2022-07-20 04:15:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:28,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933007860] [2022-07-20 04:15:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:15:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:15:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:15:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 04:15:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:15:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:15:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:15:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 04:15:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 04:15:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:15:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 04:15:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-07-20 04:15:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933007860] [2022-07-20 04:15:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933007860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:28,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:28,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 04:15:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179561126] [2022-07-20 04:15:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:28,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 04:15:28,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 04:15:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:15:28,502 INFO L87 Difference]: Start difference. First operand 2144 states and 2803 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-20 04:15:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:30,840 INFO L93 Difference]: Finished difference Result 2252 states and 2980 transitions. [2022-07-20 04:15:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:15:30,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) Word has length 252 [2022-07-20 04:15:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:30,847 INFO L225 Difference]: With dead ends: 2252 [2022-07-20 04:15:30,847 INFO L226 Difference]: Without dead ends: 2250 [2022-07-20 04:15:30,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:15:30,849 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 1626 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 1880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 4556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1880 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:30,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 4014 Invalid, 4556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1880 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:15:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-07-20 04:15:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2142. [2022-07-20 04:15:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1454 states have (on average 1.1980742778541953) internal successors, (1742), 1488 states have internal predecessors, (1742), 520 states have call successors, (520), 161 states have call predecessors, (520), 166 states have return successors, (537), 520 states have call predecessors, (537), 518 states have call successors, (537) [2022-07-20 04:15:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2799 transitions. [2022-07-20 04:15:30,995 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2799 transitions. Word has length 252 [2022-07-20 04:15:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:30,996 INFO L495 AbstractCegarLoop]: Abstraction has 2142 states and 2799 transitions. [2022-07-20 04:15:30,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 9 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-20 04:15:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2799 transitions. [2022-07-20 04:15:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-07-20 04:15:31,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:31,001 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:31,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-20 04:15:31,002 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -578147250, now seen corresponding path program 1 times [2022-07-20 04:15:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:31,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463151783] [2022-07-20 04:15:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:31,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:31,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930268688] [2022-07-20 04:15:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:31,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:31,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 04:15:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 04:15:31,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2022-07-20 04:15:31,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:15:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2022-07-20 04:15:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463151783] [2022-07-20 04:15:32,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930268688] [2022-07-20 04:15:32,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930268688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:15:32,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:15:32,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2022-07-20 04:15:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465602027] [2022-07-20 04:15:32,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:15:32,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 04:15:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 04:15:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2022-07-20 04:15:32,338 INFO L87 Difference]: Start difference. First operand 2142 states and 2799 transitions. Second operand has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-20 04:15:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:32,787 INFO L93 Difference]: Finished difference Result 2150 states and 2806 transitions. [2022-07-20 04:15:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 04:15:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) Word has length 382 [2022-07-20 04:15:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:32,791 INFO L225 Difference]: With dead ends: 2150 [2022-07-20 04:15:32,791 INFO L226 Difference]: Without dead ends: 2142 [2022-07-20 04:15:32,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-07-20 04:15:32,792 INFO L413 NwaCegarLoop]: 1069 mSDtfsCounter, 461 mSDsluCounter, 14302 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 15371 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:32,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 15371 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 04:15:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-07-20 04:15:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2138. [2022-07-20 04:15:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1453 states have (on average 1.1968341362697867) internal successors, (1739), 1485 states have internal predecessors, (1739), 517 states have call successors, (517), 161 states have call predecessors, (517), 166 states have return successors, (535), 519 states have call predecessors, (535), 516 states have call successors, (535) [2022-07-20 04:15:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2791 transitions. [2022-07-20 04:15:32,916 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2791 transitions. Word has length 382 [2022-07-20 04:15:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:32,916 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2791 transitions. [2022-07-20 04:15:32,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (50), 8 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-20 04:15:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2791 transitions. [2022-07-20 04:15:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2022-07-20 04:15:32,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:32,921 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:32,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:33,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:33,148 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1729621242, now seen corresponding path program 1 times [2022-07-20 04:15:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076872475] [2022-07-20 04:15:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:33,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:33,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177290120] [2022-07-20 04:15:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:33,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:33,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:33,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:33,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 04:15:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:37,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 04:15:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2022-07-20 04:15:37,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:15:37,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:37,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076872475] [2022-07-20 04:15:37,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:37,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177290120] [2022-07-20 04:15:37,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177290120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:37,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:37,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:37,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311436640] [2022-07-20 04:15:37,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:37,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:37,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:37,973 INFO L87 Difference]: Start difference. First operand 2138 states and 2791 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-20 04:15:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:38,220 INFO L93 Difference]: Finished difference Result 3987 states and 5268 transitions. [2022-07-20 04:15:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:15:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) Word has length 388 [2022-07-20 04:15:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:38,227 INFO L225 Difference]: With dead ends: 3987 [2022-07-20 04:15:38,228 INFO L226 Difference]: Without dead ends: 2339 [2022-07-20 04:15:38,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:15:38,233 INFO L413 NwaCegarLoop]: 1215 mSDtfsCounter, 368 mSDsluCounter, 4397 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 5612 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:38,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 5612 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:15:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2022-07-20 04:15:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2138. [2022-07-20 04:15:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1453 states have (on average 1.1954576737783895) internal successors, (1737), 1485 states have internal predecessors, (1737), 517 states have call successors, (517), 161 states have call predecessors, (517), 166 states have return successors, (535), 519 states have call predecessors, (535), 516 states have call successors, (535) [2022-07-20 04:15:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2789 transitions. [2022-07-20 04:15:38,372 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2789 transitions. Word has length 388 [2022-07-20 04:15:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:38,373 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2789 transitions. [2022-07-20 04:15:38,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (49), 2 states have call predecessors, (49), 3 states have return successors, (48), 3 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-20 04:15:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2789 transitions. [2022-07-20 04:15:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-07-20 04:15:38,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:38,377 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:38,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-20 04:15:38,592 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -546554695, now seen corresponding path program 1 times [2022-07-20 04:15:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:38,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695249151] [2022-07-20 04:15:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:38,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316064313] [2022-07-20 04:15:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:38,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:38,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:38,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:38,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 04:15:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:39,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 2730 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 04:15:39,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 41 proven. 123 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-07-20 04:15:39,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:15:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2022-07-20 04:15:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:40,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695249151] [2022-07-20 04:15:40,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:40,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316064313] [2022-07-20 04:15:40,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316064313] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 04:15:40,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:15:40,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2022-07-20 04:15:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686750039] [2022-07-20 04:15:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:40,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:15:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:15:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:15:40,075 INFO L87 Difference]: Start difference. First operand 2138 states and 2789 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2022-07-20 04:15:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:43,956 INFO L93 Difference]: Finished difference Result 4306 states and 5605 transitions. [2022-07-20 04:15:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:15:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 403 [2022-07-20 04:15:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:43,969 INFO L225 Difference]: With dead ends: 4306 [2022-07-20 04:15:43,969 INFO L226 Difference]: Without dead ends: 4271 [2022-07-20 04:15:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 795 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-07-20 04:15:43,973 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 3609 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 4557 mSolverCounterSat, 2206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3717 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 6763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2206 IncrementalHoareTripleChecker+Valid, 4557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:43,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3717 Valid, 4553 Invalid, 6763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2206 Valid, 4557 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:15:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-07-20 04:15:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4255. [2022-07-20 04:15:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 2891 states have (on average 1.1968177101349013) internal successors, (3460), 2954 states have internal predecessors, (3460), 1027 states have call successors, (1027), 320 states have call predecessors, (1027), 335 states have return successors, (1064), 1035 states have call predecessors, (1064), 1026 states have call successors, (1064) [2022-07-20 04:15:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5551 transitions. [2022-07-20 04:15:44,309 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5551 transitions. Word has length 403 [2022-07-20 04:15:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:44,310 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 5551 transitions. [2022-07-20 04:15:44,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 4 states have call successors, (50), 4 states have call predecessors, (50), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2022-07-20 04:15:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5551 transitions. [2022-07-20 04:15:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-07-20 04:15:44,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:44,314 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:44,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 04:15:44,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-20 04:15:44,528 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash -52787875, now seen corresponding path program 1 times [2022-07-20 04:15:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:44,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914177240] [2022-07-20 04:15:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:15:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:15:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:15:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 04:15:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:15:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:15:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 04:15:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 04:15:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 04:15:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 04:15:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:15:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 04:15:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-20 04:15:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-20 04:15:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-20 04:15:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-20 04:15:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:15:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 04:15:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-20 04:15:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-20 04:15:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-20 04:15:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-20 04:15:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-20 04:15:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:15:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-20 04:15:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-20 04:15:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-20 04:15:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 04:15:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-20 04:15:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-20 04:15:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:15:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 04:15:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 04:15:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 04:15:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:15:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 04:15:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 04:15:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-07-20 04:15:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2022-07-20 04:15:45,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:45,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914177240] [2022-07-20 04:15:45,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914177240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:45,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-20 04:15:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630528432] [2022-07-20 04:15:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:45,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 04:15:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:45,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 04:15:45,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-20 04:15:45,222 INFO L87 Difference]: Start difference. First operand 4255 states and 5551 transitions. Second operand has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2022-07-20 04:15:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:53,212 INFO L93 Difference]: Finished difference Result 10131 states and 13827 transitions. [2022-07-20 04:15:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 04:15:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) Word has length 384 [2022-07-20 04:15:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:53,228 INFO L225 Difference]: With dead ends: 10131 [2022-07-20 04:15:53,228 INFO L226 Difference]: Without dead ends: 7001 [2022-07-20 04:15:53,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 04:15:53,237 INFO L413 NwaCegarLoop]: 1617 mSDtfsCounter, 3601 mSDsluCounter, 12920 mSDsCounter, 0 mSdLazyCounter, 12320 mSolverCounterSat, 3236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3713 SdHoareTripleChecker+Valid, 14537 SdHoareTripleChecker+Invalid, 15556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3236 IncrementalHoareTripleChecker+Valid, 12320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:53,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3713 Valid, 14537 Invalid, 15556 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3236 Valid, 12320 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 04:15:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-20 04:15:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 4473. [2022-07-20 04:15:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 3033 states have (on average 1.1928783382789319) internal successors, (3618), 3090 states have internal predecessors, (3618), 1103 states have call successors, (1103), 320 states have call predecessors, (1103), 335 states have return successors, (1140), 1109 states have call predecessors, (1140), 1102 states have call successors, (1140) [2022-07-20 04:15:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 5861 transitions. [2022-07-20 04:15:53,695 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 5861 transitions. Word has length 384 [2022-07-20 04:15:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:53,695 INFO L495 AbstractCegarLoop]: Abstraction has 4473 states and 5861 transitions. [2022-07-20 04:15:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.95) internal successors, (159), 14 states have internal predecessors, (159), 6 states have call successors, (60), 8 states have call predecessors, (60), 3 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2022-07-20 04:15:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 5861 transitions. [2022-07-20 04:15:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-07-20 04:15:53,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:53,700 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 14, 14, 14, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:53,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-20 04:15:53,701 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash 507130644, now seen corresponding path program 1 times [2022-07-20 04:15:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:53,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562607728] [2022-07-20 04:15:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:53,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:53,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821940358] [2022-07-20 04:15:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:53,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:53,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 04:15:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:54,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 3248 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 04:15:54,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-07-20 04:15:54,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:15:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:54,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562607728] [2022-07-20 04:15:54,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:54,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821940358] [2022-07-20 04:15:54,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821940358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:54,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:54,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 04:15:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525246370] [2022-07-20 04:15:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:54,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:15:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:15:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:15:54,658 INFO L87 Difference]: Start difference. First operand 4473 states and 5861 transitions. Second operand has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2022-07-20 04:15:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:56,215 INFO L93 Difference]: Finished difference Result 9314 states and 12604 transitions. [2022-07-20 04:15:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 04:15:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 476 [2022-07-20 04:15:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:56,228 INFO L225 Difference]: With dead ends: 9314 [2022-07-20 04:15:56,229 INFO L226 Difference]: Without dead ends: 6071 [2022-07-20 04:15:56,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-07-20 04:15:56,237 INFO L413 NwaCegarLoop]: 1656 mSDtfsCounter, 1846 mSDsluCounter, 19056 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 20712 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:56,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 20712 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 04:15:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2022-07-20 04:15:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3825. [2022-07-20 04:15:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3825 states, 2608 states have (on average 1.1982361963190185) internal successors, (3125), 2664 states have internal predecessors, (3125), 923 states have call successors, (923), 275 states have call predecessors, (923), 292 states have return successors, (960), 936 states have call predecessors, (960), 922 states have call successors, (960) [2022-07-20 04:15:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5008 transitions. [2022-07-20 04:15:56,665 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5008 transitions. Word has length 476 [2022-07-20 04:15:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:56,665 INFO L495 AbstractCegarLoop]: Abstraction has 3825 states and 5008 transitions. [2022-07-20 04:15:56,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 7 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2022-07-20 04:15:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5008 transitions. [2022-07-20 04:15:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-07-20 04:15:56,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:56,669 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 10, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:15:56,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 04:15:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-20 04:15:56,883 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:15:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2012579196, now seen corresponding path program 1 times [2022-07-20 04:15:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305640816] [2022-07-20 04:15:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:56,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:15:56,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182004246] [2022-07-20 04:15:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:15:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:15:56,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:15:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 04:15:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 3433 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 04:15:57,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:15:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 66 proven. 314 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2022-07-20 04:15:58,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:15:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-07-20 04:15:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:58,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305640816] [2022-07-20 04:15:58,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:15:58,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182004246] [2022-07-20 04:15:58,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182004246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:15:58,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:15:58,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-07-20 04:15:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468145584] [2022-07-20 04:15:58,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:15:58,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 04:15:58,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 04:15:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:15:58,832 INFO L87 Difference]: Start difference. First operand 3825 states and 5008 transitions. Second operand has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2022-07-20 04:16:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:03,061 INFO L93 Difference]: Finished difference Result 5005 states and 6530 transitions. [2022-07-20 04:16:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 04:16:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 528 [2022-07-20 04:16:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:03,076 INFO L225 Difference]: With dead ends: 5005 [2022-07-20 04:16:03,077 INFO L226 Difference]: Without dead ends: 5003 [2022-07-20 04:16:03,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-07-20 04:16:03,080 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 2270 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 1295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 3845 SdHoareTripleChecker+Invalid, 5247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1295 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:03,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 3845 Invalid, 5247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1295 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:16:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-07-20 04:16:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 4958. [2022-07-20 04:16:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4958 states, 3374 states have (on average 1.1944279786603438) internal successors, (4030), 3447 states have internal predecessors, (4030), 1200 states have call successors, (1200), 357 states have call predecessors, (1200), 382 states have return successors, (1249), 1217 states have call predecessors, (1249), 1199 states have call successors, (1249) [2022-07-20 04:16:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 6479 transitions. [2022-07-20 04:16:03,634 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 6479 transitions. Word has length 528 [2022-07-20 04:16:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:03,634 INFO L495 AbstractCegarLoop]: Abstraction has 4958 states and 6479 transitions. [2022-07-20 04:16:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 5 states have call successors, (81), 6 states have call predecessors, (81), 7 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2022-07-20 04:16:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 6479 transitions. [2022-07-20 04:16:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-07-20 04:16:03,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:03,639 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 10, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:03,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-20 04:16:03,840 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1663947809, now seen corresponding path program 1 times [2022-07-20 04:16:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:03,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595603066] [2022-07-20 04:16:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:03,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:03,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90501813] [2022-07-20 04:16:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:03,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:03,904 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 04:16:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:04,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 3893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:16:04,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2022-07-20 04:16:04,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595603066] [2022-07-20 04:16:04,775 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:04,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90501813] [2022-07-20 04:16:04,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90501813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:04,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:04,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 04:16:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269286542] [2022-07-20 04:16:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:16:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:16:04,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:04,780 INFO L87 Difference]: Start difference. First operand 4958 states and 6479 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2022-07-20 04:16:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:05,480 INFO L93 Difference]: Finished difference Result 9875 states and 12953 transitions. [2022-07-20 04:16:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:16:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 546 [2022-07-20 04:16:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:05,494 INFO L225 Difference]: With dead ends: 9875 [2022-07-20 04:16:05,494 INFO L226 Difference]: Without dead ends: 5302 [2022-07-20 04:16:05,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:05,502 INFO L413 NwaCegarLoop]: 1180 mSDtfsCounter, 74 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:05,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 04:16:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2022-07-20 04:16:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 4973. [2022-07-20 04:16:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4973 states, 3389 states have (on average 1.1935674240188847) internal successors, (4045), 3462 states have internal predecessors, (4045), 1200 states have call successors, (1200), 357 states have call predecessors, (1200), 382 states have return successors, (1249), 1217 states have call predecessors, (1249), 1199 states have call successors, (1249) [2022-07-20 04:16:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 6494 transitions. [2022-07-20 04:16:06,017 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 6494 transitions. Word has length 546 [2022-07-20 04:16:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:06,018 INFO L495 AbstractCegarLoop]: Abstraction has 4973 states and 6494 transitions. [2022-07-20 04:16:06,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2022-07-20 04:16:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 6494 transitions. [2022-07-20 04:16:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2022-07-20 04:16:06,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:06,024 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:06,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:06,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:06,225 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1674679240, now seen corresponding path program 1 times [2022-07-20 04:16:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:06,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504200527] [2022-07-20 04:16:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:06,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:06,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195295152] [2022-07-20 04:16:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:06,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 04:16:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:07,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 4796 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 04:16:07,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 1252 trivial. 0 not checked. [2022-07-20 04:16:07,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:07,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504200527] [2022-07-20 04:16:07,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195295152] [2022-07-20 04:16:07,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195295152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:07,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:07,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 04:16:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580937922] [2022-07-20 04:16:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:16:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:16:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:07,821 INFO L87 Difference]: Start difference. First operand 4973 states and 6494 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2022-07-20 04:16:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:08,316 INFO L93 Difference]: Finished difference Result 9492 states and 12401 transitions. [2022-07-20 04:16:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:16:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 721 [2022-07-20 04:16:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:08,329 INFO L225 Difference]: With dead ends: 9492 [2022-07-20 04:16:08,329 INFO L226 Difference]: Without dead ends: 4963 [2022-07-20 04:16:08,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:08,337 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 800 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:08,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1090 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:16:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2022-07-20 04:16:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4963. [2022-07-20 04:16:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4963 states, 3384 states have (on average 1.1908983451536643) internal successors, (4030), 3457 states have internal predecessors, (4030), 1195 states have call successors, (1195), 357 states have call predecessors, (1195), 382 states have return successors, (1244), 1212 states have call predecessors, (1244), 1194 states have call successors, (1244) [2022-07-20 04:16:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 6469 transitions. [2022-07-20 04:16:08,918 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 6469 transitions. Word has length 721 [2022-07-20 04:16:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:08,919 INFO L495 AbstractCegarLoop]: Abstraction has 4963 states and 6469 transitions. [2022-07-20 04:16:08,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 2 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2022-07-20 04:16:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 6469 transitions. [2022-07-20 04:16:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2022-07-20 04:16:08,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:08,927 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 13, 13, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:08,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:09,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-20 04:16:09,128 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2060996514, now seen corresponding path program 1 times [2022-07-20 04:16:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:09,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424094561] [2022-07-20 04:16:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:09,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:09,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370511049] [2022-07-20 04:16:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:09,218 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:09,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 04:16:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:10,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 4836 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 04:16:10,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 699 proven. 1 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2022-07-20 04:16:10,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:16:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2022-07-20 04:16:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:10,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424094561] [2022-07-20 04:16:10,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:10,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370511049] [2022-07-20 04:16:10,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370511049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:16:10,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:16:10,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 04:16:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050790998] [2022-07-20 04:16:10,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:16:10,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:16:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:16:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:16:10,652 INFO L87 Difference]: Start difference. First operand 4963 states and 6469 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) [2022-07-20 04:16:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:11,829 INFO L93 Difference]: Finished difference Result 10757 states and 14193 transitions. [2022-07-20 04:16:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:16:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) Word has length 731 [2022-07-20 04:16:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:11,844 INFO L225 Difference]: With dead ends: 10757 [2022-07-20 04:16:11,844 INFO L226 Difference]: Without dead ends: 6180 [2022-07-20 04:16:11,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1460 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:16:11,852 INFO L413 NwaCegarLoop]: 1256 mSDtfsCounter, 487 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:11,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 4335 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:16:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6180 states. [2022-07-20 04:16:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6180 to 5263. [2022-07-20 04:16:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 3594 states have (on average 1.1922648859209795) internal successors, (4285), 3667 states have internal predecessors, (4285), 1285 states have call successors, (1285), 357 states have call predecessors, (1285), 382 states have return successors, (1334), 1302 states have call predecessors, (1334), 1284 states have call successors, (1334) [2022-07-20 04:16:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 6904 transitions. [2022-07-20 04:16:12,500 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 6904 transitions. Word has length 731 [2022-07-20 04:16:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:12,501 INFO L495 AbstractCegarLoop]: Abstraction has 5263 states and 6904 transitions. [2022-07-20 04:16:12,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 4 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (123), 4 states have call predecessors, (123), 4 states have call successors, (123) [2022-07-20 04:16:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 6904 transitions. [2022-07-20 04:16:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1071 [2022-07-20 04:16:12,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:12,511 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:12,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:12,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:12,712 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 487123768, now seen corresponding path program 1 times [2022-07-20 04:16:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:12,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539167782] [2022-07-20 04:16:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:12,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937984043] [2022-07-20 04:16:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:12,802 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:12,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 04:16:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:14,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 6566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 04:16:14,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 1836 proven. 64 refuted. 0 times theorem prover too weak. 2026 trivial. 0 not checked. [2022-07-20 04:16:14,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:16:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3926 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 3859 trivial. 0 not checked. [2022-07-20 04:16:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539167782] [2022-07-20 04:16:14,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937984043] [2022-07-20 04:16:14,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937984043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 04:16:14,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 04:16:14,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-20 04:16:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946816897] [2022-07-20 04:16:14,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 04:16:14,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:16:14,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:16:14,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:16:14,842 INFO L87 Difference]: Start difference. First operand 5263 states and 6904 transitions. Second operand has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) [2022-07-20 04:16:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:16,893 INFO L93 Difference]: Finished difference Result 12383 states and 16552 transitions. [2022-07-20 04:16:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:16:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) Word has length 1070 [2022-07-20 04:16:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:16,914 INFO L225 Difference]: With dead ends: 12383 [2022-07-20 04:16:16,915 INFO L226 Difference]: Without dead ends: 7536 [2022-07-20 04:16:16,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2138 GetRequests, 2130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:16:16,925 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 1258 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:16,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 4712 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 04:16:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2022-07-20 04:16:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 5663. [2022-07-20 04:16:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 3874 states have (on average 1.1938564790913784) internal successors, (4625), 3947 states have internal predecessors, (4625), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1422 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-20 04:16:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 7484 transitions. [2022-07-20 04:16:17,661 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 7484 transitions. Word has length 1070 [2022-07-20 04:16:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:17,662 INFO L495 AbstractCegarLoop]: Abstraction has 5663 states and 7484 transitions. [2022-07-20 04:16:17,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.2) internal successors, (312), 10 states have internal predecessors, (312), 9 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (138), 9 states have call predecessors, (138), 9 states have call successors, (138) [2022-07-20 04:16:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 7484 transitions. [2022-07-20 04:16:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1523 [2022-07-20 04:16:17,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:17,681 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:17,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-20 04:16:17,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:17,882 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2099751536, now seen corresponding path program 2 times [2022-07-20 04:16:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:17,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845194108] [2022-07-20 04:16:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:18,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:18,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118945388] [2022-07-20 04:16:18,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 04:16:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:18,015 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 04:16:19,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 04:16:19,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 04:16:19,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 8858 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 04:16:19,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9784 backedges. 1512 proven. 0 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2022-07-20 04:16:19,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:19,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845194108] [2022-07-20 04:16:19,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:19,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118945388] [2022-07-20 04:16:19,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118945388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:19,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:19,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 04:16:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471536467] [2022-07-20 04:16:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:19,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 04:16:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 04:16:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 04:16:19,857 INFO L87 Difference]: Start difference. First operand 5663 states and 7484 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2022-07-20 04:16:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:20,874 INFO L93 Difference]: Finished difference Result 11416 states and 15129 transitions. [2022-07-20 04:16:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 04:16:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 1522 [2022-07-20 04:16:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:20,891 INFO L225 Difference]: With dead ends: 11416 [2022-07-20 04:16:20,892 INFO L226 Difference]: Without dead ends: 6122 [2022-07-20 04:16:20,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1523 GetRequests, 1520 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 04:16:20,905 INFO L413 NwaCegarLoop]: 1267 mSDtfsCounter, 131 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 3536 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 3536 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 04:16:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2022-07-20 04:16:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5669. [2022-07-20 04:16:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 3880 states have (on average 1.1935567010309278) internal successors, (4631), 3953 states have internal predecessors, (4631), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1422 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-20 04:16:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7490 transitions. [2022-07-20 04:16:21,605 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7490 transitions. Word has length 1522 [2022-07-20 04:16:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:21,605 INFO L495 AbstractCegarLoop]: Abstraction has 5669 states and 7490 transitions. [2022-07-20 04:16:21,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 2 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2022-07-20 04:16:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7490 transitions. [2022-07-20 04:16:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2022-07-20 04:16:21,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:21,625 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:21,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:21,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-20 04:16:21,825 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1483846966, now seen corresponding path program 1 times [2022-07-20 04:16:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:21,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353657096] [2022-07-20 04:16:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:21,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:21,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156644076] [2022-07-20 04:16:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:21,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:21,945 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:21,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 04:16:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:23,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 8941 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 04:16:23,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 1590 proven. 0 refuted. 0 times theorem prover too weak. 8248 trivial. 0 not checked. [2022-07-20 04:16:23,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:23,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:23,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353657096] [2022-07-20 04:16:23,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:23,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156644076] [2022-07-20 04:16:23,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156644076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:23,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:23,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:16:23,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929334445] [2022-07-20 04:16:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:16:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:23,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:16:23,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:16:23,795 INFO L87 Difference]: Start difference. First operand 5669 states and 7490 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) [2022-07-20 04:16:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:24,788 INFO L93 Difference]: Finished difference Result 11537 states and 15305 transitions. [2022-07-20 04:16:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:16:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) Word has length 1542 [2022-07-20 04:16:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:24,801 INFO L225 Difference]: With dead ends: 11537 [2022-07-20 04:16:24,801 INFO L226 Difference]: Without dead ends: 6227 [2022-07-20 04:16:24,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1548 GetRequests, 1538 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:16:24,810 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 383 mSDsluCounter, 7154 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 8392 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:24,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 8392 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 04:16:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2022-07-20 04:16:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5676. [2022-07-20 04:16:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 3887 states have (on average 1.193208129662979) internal successors, (4638), 3962 states have internal predecessors, (4638), 1405 states have call successors, (1405), 357 states have call predecessors, (1405), 382 states have return successors, (1454), 1420 states have call predecessors, (1454), 1404 states have call successors, (1454) [2022-07-20 04:16:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 7497 transitions. [2022-07-20 04:16:25,496 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 7497 transitions. Word has length 1542 [2022-07-20 04:16:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:25,496 INFO L495 AbstractCegarLoop]: Abstraction has 5676 states and 7497 transitions. [2022-07-20 04:16:25,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 7 states have internal predecessors, (259), 2 states have call successors, (89), 2 states have call predecessors, (89), 3 states have return successors, (88), 3 states have call predecessors, (88), 2 states have call successors, (88) [2022-07-20 04:16:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 7497 transitions. [2022-07-20 04:16:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1600 [2022-07-20 04:16:25,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:25,516 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:25,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:25,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:25,717 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash 809345631, now seen corresponding path program 1 times [2022-07-20 04:16:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:25,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093416061] [2022-07-20 04:16:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:25,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:25,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569793238] [2022-07-20 04:16:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:25,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:25,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:25,839 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:25,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 04:16:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:27,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 9264 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 04:16:27,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10228 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 9829 trivial. 0 not checked. [2022-07-20 04:16:27,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093416061] [2022-07-20 04:16:27,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:27,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569793238] [2022-07-20 04:16:27,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569793238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:27,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:27,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-20 04:16:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659712176] [2022-07-20 04:16:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:27,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:16:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:27,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:16:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:16:27,903 INFO L87 Difference]: Start difference. First operand 5676 states and 7497 transitions. Second operand has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2022-07-20 04:16:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:29,447 INFO L93 Difference]: Finished difference Result 8797 states and 11930 transitions. [2022-07-20 04:16:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 04:16:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 1599 [2022-07-20 04:16:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:29,462 INFO L225 Difference]: With dead ends: 8797 [2022-07-20 04:16:29,463 INFO L226 Difference]: Without dead ends: 5193 [2022-07-20 04:16:29,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1616 GetRequests, 1590 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-07-20 04:16:29,471 INFO L413 NwaCegarLoop]: 1813 mSDtfsCounter, 2897 mSDsluCounter, 18602 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 20415 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:29,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 20415 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 04:16:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2022-07-20 04:16:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 2364. [2022-07-20 04:16:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 1616 states have (on average 1.1862623762376239) internal successors, (1917), 1643 states have internal predecessors, (1917), 578 states have call successors, (578), 157 states have call predecessors, (578), 168 states have return successors, (594), 590 states have call predecessors, (594), 577 states have call successors, (594) [2022-07-20 04:16:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3089 transitions. [2022-07-20 04:16:29,896 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3089 transitions. Word has length 1599 [2022-07-20 04:16:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:29,897 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 3089 transitions. [2022-07-20 04:16:29,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 19.615384615384617) internal successors, (255), 13 states have internal predecessors, (255), 6 states have call successors, (94), 2 states have call predecessors, (94), 4 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2022-07-20 04:16:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3089 transitions. [2022-07-20 04:16:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2022-07-20 04:16:29,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:29,930 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:29,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-20 04:16:30,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:30,131 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash -390783929, now seen corresponding path program 1 times [2022-07-20 04:16:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218653701] [2022-07-20 04:16:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:30,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:30,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954168681] [2022-07-20 04:16:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:30,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:30,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:30,279 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 04:16:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:32,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 11049 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 04:16:32,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13966 backedges. 1491 proven. 0 refuted. 0 times theorem prover too weak. 12475 trivial. 0 not checked. [2022-07-20 04:16:32,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:32,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218653701] [2022-07-20 04:16:32,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:32,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954168681] [2022-07-20 04:16:32,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954168681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:32,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:16:32,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 04:16:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414977810] [2022-07-20 04:16:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:16:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:16:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:32,626 INFO L87 Difference]: Start difference. First operand 2364 states and 3089 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2022-07-20 04:16:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:32,999 INFO L93 Difference]: Finished difference Result 4639 states and 6096 transitions. [2022-07-20 04:16:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:16:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) Word has length 1939 [2022-07-20 04:16:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:33,008 INFO L225 Difference]: With dead ends: 4639 [2022-07-20 04:16:33,008 INFO L226 Difference]: Without dead ends: 2458 [2022-07-20 04:16:33,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1938 GetRequests, 1937 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 04:16:33,013 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 40 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:33,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 04:16:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2022-07-20 04:16:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2366. [2022-07-20 04:16:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1618 states have (on average 1.1860321384425216) internal successors, (1919), 1645 states have internal predecessors, (1919), 578 states have call successors, (578), 157 states have call predecessors, (578), 168 states have return successors, (594), 590 states have call predecessors, (594), 577 states have call successors, (594) [2022-07-20 04:16:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3091 transitions. [2022-07-20 04:16:33,369 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3091 transitions. Word has length 1939 [2022-07-20 04:16:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:33,369 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 3091 transitions. [2022-07-20 04:16:33,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 2 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2022-07-20 04:16:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3091 transitions. [2022-07-20 04:16:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1943 [2022-07-20 04:16:33,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:33,395 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:33,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:33,596 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1932668400, now seen corresponding path program 1 times [2022-07-20 04:16:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:33,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830133751] [2022-07-20 04:16:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:33,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375783295] [2022-07-20 04:16:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:33,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:33,737 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:33,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 04:16:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:36,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 11052 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-20 04:16:36,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:36,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:36,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:36,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:36,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:36,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,013 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 04:16:37,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 04:16:37,076 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 04:16:37,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 04:16:37,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:37,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 04:16:37,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,324 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 04:16:37,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 04:16:37,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:37,499 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 04:16:37,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 04:16:37,934 INFO L356 Elim1Store]: treesize reduction 679, result has 12.6 percent of original size [2022-07-20 04:16:37,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 129 [2022-07-20 04:16:39,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 04:16:39,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-20 04:16:39,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 04:16:39,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:40,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:40,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:40,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:40,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:40,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:40,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:41,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:41,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:41,504 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 04:16:41,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 04:16:41,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:41,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:41,546 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-07-20 04:16:41,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 33 [2022-07-20 04:16:41,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:41,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 04:16:41,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 04:16:41,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 04:16:42,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:42,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:42,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:42,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:42,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:42,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:42,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:42,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:16:42,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:16:42,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:42,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:42,940 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-20 04:16:42,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2022-07-20 04:16:42,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:43,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:43,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:44,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 04:16:44,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 04:16:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13966 backedges. 1639 proven. 302 refuted. 0 times theorem prover too weak. 12025 trivial. 0 not checked. [2022-07-20 04:16:44,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 04:16:45,504 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_16732 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_ca91cx42_probe_~ca91cx42_bridge~5#1.base| v_ArrVal_16732) |c_~#driver_name~0.base|) |c_~#driver_name~0.offset|))) (= c_~ldv_linux_net_register_probe_state~0 1)) is different from false [2022-07-20 04:16:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830133751] [2022-07-20 04:16:45,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 04:16:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375783295] [2022-07-20 04:16:45,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375783295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:16:45,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:16:45,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2022-07-20 04:16:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64172465] [2022-07-20 04:16:45,511 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-20 04:16:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 04:16:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 04:16:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2109, Unknown=52, NotChecked=94, Total=2450 [2022-07-20 04:16:45,513 INFO L87 Difference]: Start difference. First operand 2366 states and 3091 transitions. Second operand has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) [2022-07-20 04:16:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:55,953 INFO L93 Difference]: Finished difference Result 6270 states and 8115 transitions. [2022-07-20 04:16:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 04:16:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) Word has length 1942 [2022-07-20 04:16:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:55,966 INFO L225 Difference]: With dead ends: 6270 [2022-07-20 04:16:55,966 INFO L226 Difference]: Without dead ends: 4087 [2022-07-20 04:16:55,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3599 GetRequests, 3535 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=263, Invalid=2874, Unknown=59, NotChecked=110, Total=3306 [2022-07-20 04:16:55,973 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 1317 mSDsluCounter, 17291 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 18644 SdHoareTripleChecker+Invalid, 20400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15807 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:55,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 18644 Invalid, 20400 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [197 Valid, 4396 Invalid, 0 Unknown, 15807 Unchecked, 9.3s Time] [2022-07-20 04:16:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2022-07-20 04:16:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4005. [2022-07-20 04:16:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 2734 states have (on average 1.1693489392831016) internal successors, (3197), 2773 states have internal predecessors, (3197), 952 states have call successors, (952), 300 states have call predecessors, (952), 317 states have return successors, (984), 971 states have call predecessors, (984), 951 states have call successors, (984) [2022-07-20 04:16:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5133 transitions. [2022-07-20 04:16:56,601 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5133 transitions. Word has length 1942 [2022-07-20 04:16:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:56,601 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5133 transitions. [2022-07-20 04:16:56,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 8.86046511627907) internal successors, (381), 35 states have internal predecessors, (381), 19 states have call successors, (136), 11 states have call predecessors, (136), 16 states have return successors, (136), 21 states have call predecessors, (136), 19 states have call successors, (136) [2022-07-20 04:16:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5133 transitions. [2022-07-20 04:16:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1945 [2022-07-20 04:16:56,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:56,632 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 13, 13, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 04:16:56,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-20 04:16:56,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-20 04:16:56,833 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-20 04:16:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1021379445, now seen corresponding path program 1 times [2022-07-20 04:16:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947838990] [2022-07-20 04:16:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:56,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 04:16:56,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918315801] [2022-07-20 04:16:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:56,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:56,995 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:56,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 04:16:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:59,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 11069 conjuncts, 238 conjunts are in the unsatisfiable core [2022-07-20 04:16:59,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:59,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 04:16:59,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 04:16:59,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:59,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:59,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:16:59,965 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 04:16:59,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 04:16:59,995 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 04:16:59,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 04:17:00,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 04:17:00,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 04:17:00,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,208 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-20 04:17:00,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-07-20 04:17:00,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-20 04:17:00,423 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-20 04:17:00,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 38 [2022-07-20 04:17:00,901 INFO L356 Elim1Store]: treesize reduction 660, result has 15.1 percent of original size [2022-07-20 04:17:00,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 132 [2022-07-20 04:17:01,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-20 04:17:01,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 04:17:01,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2022-07-20 04:17:01,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:01,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:01,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-20 04:17:01,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:01,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-20 04:17:01,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:01,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-20 04:17:01,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:01,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-20 04:17:02,132 INFO L356 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2022-07-20 04:17:02,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 75 [2022-07-20 04:17:02,212 INFO L356 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-07-20 04:17:02,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-20 04:17:02,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 04:17:02,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 04:17:02,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 04:17:02,436 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-20 04:17:02,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-07-20 04:17:02,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:17:02,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:02,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:17:02,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:02,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:17:02,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:02,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:17:03,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 04:17:03,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 04:17:03,684 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-20 04:17:03,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 47 [2022-07-20 04:17:03,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 04:17:03,764 INFO L356 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2022-07-20 04:17:03,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-07-20 04:17:03,974 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-20 04:17:03,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2022-07-20 04:17:30,300 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 04:17:30,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36