./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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---kernel--locking--locktorture.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 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:46:47,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:46:47,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:46:47,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:46:47,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:46:47,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:46:47,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:46:47,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:46:47,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:46:47,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:46:47,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:46:47,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:46:47,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:46:47,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:46:47,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:46:47,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:46:47,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:46:47,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:46:47,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:46:47,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:46:47,897 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:46:47,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:46:47,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:46:47,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:46:47,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:46:47,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:46:47,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:46:47,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:46:47,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:46:47,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:46:47,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:46:47,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:46:47,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:46:47,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:46:47,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:46:47,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:46:47,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:46:47,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:46:47,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:46:47,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:46:47,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:46:47,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:46:47,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:46:47,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:46:47,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:46:47,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:46:47,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:46:47,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:46:47,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:46:47,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:46:47,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:46:47,939 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:46:47,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:46:47,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:46:47,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:46:47,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:46:47,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:46:47,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:46:47,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:46:47,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:46:47,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:46:47,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:46:47,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:46:47,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:46:47,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:46:47,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:46:47,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:46:47,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:46:47,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:46:47,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:46:47,948 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:46:47,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:46:47,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:46:47,949 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 -> 3999042d9cc74b4d3f513a03b2b33730a93b6921729afd52c1fac5c320bfa594 [2022-07-21 15:46:48,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:46:48,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:46:48,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:46:48,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:46:48,295 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:46:48,296 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---kernel--locking--locktorture.ko.cil.i [2022-07-21 15:46:48,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1800c1805/179173dabedc401498939513015066ec/FLAGdba75c9a5 [2022-07-21 15:46:49,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:46:49,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-21 15:46:49,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1800c1805/179173dabedc401498939513015066ec/FLAGdba75c9a5 [2022-07-21 15:46:49,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1800c1805/179173dabedc401498939513015066ec [2022-07-21 15:46:49,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:46:49,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:46:49,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:46:49,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:46:49,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:46:49,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:46:49" (1/1) ... [2022-07-21 15:46:49,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49babebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:49, skipping insertion in model container [2022-07-21 15:46:49,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:46:49" (1/1) ... [2022-07-21 15:46:49,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:46:49,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:46:50,935 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---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-21 15:46:50,938 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---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-21 15:46:50,943 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---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-21 15:46:50,944 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---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-21 15:46:50,945 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---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-21 15:46:50,945 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---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-21 15:46:50,945 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---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-21 15:46:50,951 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---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-21 15:46:50,952 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---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-21 15:46:50,952 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---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-21 15:46:50,954 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---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-21 15:46:50,954 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---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-21 15:46:50,955 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---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-21 15:46:50,955 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---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-21 15:46:50,955 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---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-21 15:46:50,956 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---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-21 15:46:50,957 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---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-21 15:46:50,957 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---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-21 15:46:50,958 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---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-21 15:46:50,959 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---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-21 15:46:50,959 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---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-21 15:46:50,960 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---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-21 15:46:50,960 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---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-21 15:46:50,961 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---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-21 15:46:50,961 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---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-21 15:46:50,962 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---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-21 15:46:50,962 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---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-21 15:46:50,963 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---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-21 15:46:50,964 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---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-21 15:46:50,965 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---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-21 15:46:50,966 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---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-21 15:46:50,966 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---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-21 15:46:50,967 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---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-21 15:46:50,967 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---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-21 15:46:50,967 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---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-21 15:46:50,968 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---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-21 15:46:50,968 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---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-21 15:46:50,968 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---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-21 15:46:50,969 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---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-21 15:46:50,969 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---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-21 15:46:50,970 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---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-21 15:46:50,970 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---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-21 15:46:50,970 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---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-21 15:46:50,971 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---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-21 15:46:50,971 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---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-21 15:46:50,972 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---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-21 15:46:50,972 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---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-21 15:46:50,972 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---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-21 15:46:50,973 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---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-21 15:46:50,973 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---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-21 15:46:50,973 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---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-21 15:46:50,974 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---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-21 15:46:50,978 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---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-21 15:46:50,979 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---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-21 15:46:50,979 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---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-21 15:46:50,980 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---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-21 15:46:50,980 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---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-21 15:46:50,981 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---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-21 15:46:50,981 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---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-21 15:46:50,981 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---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-21 15:46:50,982 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---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-21 15:46:50,982 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---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-21 15:46:50,983 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---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-21 15:46:50,983 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---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-21 15:46:50,984 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---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-21 15:46:50,984 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---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-21 15:46:50,986 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---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-21 15:46:50,986 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---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-21 15:46:50,987 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---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-21 15:46:50,987 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---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-21 15:46:50,987 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---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-21 15:46:50,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---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-21 15:46:50,993 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---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-21 15:46:50,993 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---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-21 15:46:51,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:46:51,019 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:46:51,199 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---kernel--locking--locktorture.ko.cil.i[234663,234676] [2022-07-21 15:46:51,200 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---kernel--locking--locktorture.ko.cil.i[234808,234821] [2022-07-21 15:46:51,200 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---kernel--locking--locktorture.ko.cil.i[234954,234967] [2022-07-21 15:46:51,201 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---kernel--locking--locktorture.ko.cil.i[235119,235132] [2022-07-21 15:46:51,201 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---kernel--locking--locktorture.ko.cil.i[235277,235290] [2022-07-21 15:46:51,202 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---kernel--locking--locktorture.ko.cil.i[235435,235448] [2022-07-21 15:46:51,203 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---kernel--locking--locktorture.ko.cil.i[235593,235606] [2022-07-21 15:46:51,204 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---kernel--locking--locktorture.ko.cil.i[235753,235766] [2022-07-21 15:46:51,204 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---kernel--locking--locktorture.ko.cil.i[235912,235925] [2022-07-21 15:46:51,205 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---kernel--locking--locktorture.ko.cil.i[236051,236064] [2022-07-21 15:46:51,205 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---kernel--locking--locktorture.ko.cil.i[236193,236206] [2022-07-21 15:46:51,206 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---kernel--locking--locktorture.ko.cil.i[236342,236355] [2022-07-21 15:46:51,206 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---kernel--locking--locktorture.ko.cil.i[236481,236494] [2022-07-21 15:46:51,207 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---kernel--locking--locktorture.ko.cil.i[236636,236649] [2022-07-21 15:46:51,210 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---kernel--locking--locktorture.ko.cil.i[236796,236809] [2022-07-21 15:46:51,210 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---kernel--locking--locktorture.ko.cil.i[236947,236960] [2022-07-21 15:46:51,211 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---kernel--locking--locktorture.ko.cil.i[237098,237111] [2022-07-21 15:46:51,211 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---kernel--locking--locktorture.ko.cil.i[237250,237263] [2022-07-21 15:46:51,211 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---kernel--locking--locktorture.ko.cil.i[237399,237412] [2022-07-21 15:46:51,212 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---kernel--locking--locktorture.ko.cil.i[237547,237560] [2022-07-21 15:46:51,212 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---kernel--locking--locktorture.ko.cil.i[237704,237717] [2022-07-21 15:46:51,212 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---kernel--locking--locktorture.ko.cil.i[237853,237866] [2022-07-21 15:46:51,213 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---kernel--locking--locktorture.ko.cil.i[238009,238022] [2022-07-21 15:46:51,214 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---kernel--locking--locktorture.ko.cil.i[238162,238175] [2022-07-21 15:46:51,214 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---kernel--locking--locktorture.ko.cil.i[238308,238321] [2022-07-21 15:46:51,214 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---kernel--locking--locktorture.ko.cil.i[238451,238464] [2022-07-21 15:46:51,215 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---kernel--locking--locktorture.ko.cil.i[238603,238616] [2022-07-21 15:46:51,215 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---kernel--locking--locktorture.ko.cil.i[238749,238762] [2022-07-21 15:46:51,215 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---kernel--locking--locktorture.ko.cil.i[238894,238907] [2022-07-21 15:46:51,216 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---kernel--locking--locktorture.ko.cil.i[239048,239061] [2022-07-21 15:46:51,216 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---kernel--locking--locktorture.ko.cil.i[239199,239212] [2022-07-21 15:46:51,216 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---kernel--locking--locktorture.ko.cil.i[239354,239367] [2022-07-21 15:46:51,217 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---kernel--locking--locktorture.ko.cil.i[239506,239519] [2022-07-21 15:46:51,217 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---kernel--locking--locktorture.ko.cil.i[239661,239674] [2022-07-21 15:46:51,218 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---kernel--locking--locktorture.ko.cil.i[239825,239838] [2022-07-21 15:46:51,218 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---kernel--locking--locktorture.ko.cil.i[239981,239994] [2022-07-21 15:46:51,219 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---kernel--locking--locktorture.ko.cil.i[240145,240158] [2022-07-21 15:46:51,219 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---kernel--locking--locktorture.ko.cil.i[240287,240300] [2022-07-21 15:46:51,219 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---kernel--locking--locktorture.ko.cil.i[240445,240458] [2022-07-21 15:46:51,220 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---kernel--locking--locktorture.ko.cil.i[240612,240625] [2022-07-21 15:46:51,221 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---kernel--locking--locktorture.ko.cil.i[240771,240784] [2022-07-21 15:46:51,221 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---kernel--locking--locktorture.ko.cil.i[240930,240943] [2022-07-21 15:46:51,222 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---kernel--locking--locktorture.ko.cil.i[241079,241092] [2022-07-21 15:46:51,222 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---kernel--locking--locktorture.ko.cil.i[241226,241239] [2022-07-21 15:46:51,222 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---kernel--locking--locktorture.ko.cil.i[241365,241378] [2022-07-21 15:46:51,223 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---kernel--locking--locktorture.ko.cil.i[241528,241541] [2022-07-21 15:46:51,223 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---kernel--locking--locktorture.ko.cil.i[241694,241707] [2022-07-21 15:46:51,223 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---kernel--locking--locktorture.ko.cil.i[241858,241871] [2022-07-21 15:46:51,224 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---kernel--locking--locktorture.ko.cil.i[242023,242036] [2022-07-21 15:46:51,224 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---kernel--locking--locktorture.ko.cil.i[242188,242201] [2022-07-21 15:46:51,224 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---kernel--locking--locktorture.ko.cil.i[242354,242367] [2022-07-21 15:46:51,225 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---kernel--locking--locktorture.ko.cil.i[242519,242532] [2022-07-21 15:46:51,225 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---kernel--locking--locktorture.ko.cil.i[242686,242699] [2022-07-21 15:46:51,225 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---kernel--locking--locktorture.ko.cil.i[242846,242859] [2022-07-21 15:46:51,226 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---kernel--locking--locktorture.ko.cil.i[243008,243021] [2022-07-21 15:46:51,226 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---kernel--locking--locktorture.ko.cil.i[243167,243180] [2022-07-21 15:46:51,226 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---kernel--locking--locktorture.ko.cil.i[243313,243326] [2022-07-21 15:46:51,227 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---kernel--locking--locktorture.ko.cil.i[243456,243469] [2022-07-21 15:46:51,227 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---kernel--locking--locktorture.ko.cil.i[243600,243613] [2022-07-21 15:46:51,227 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---kernel--locking--locktorture.ko.cil.i[243743,243756] [2022-07-21 15:46:51,228 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---kernel--locking--locktorture.ko.cil.i[243887,243900] [2022-07-21 15:46:51,228 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---kernel--locking--locktorture.ko.cil.i[244028,244041] [2022-07-21 15:46:51,229 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---kernel--locking--locktorture.ko.cil.i[244166,244179] [2022-07-21 15:46:51,231 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---kernel--locking--locktorture.ko.cil.i[244324,244337] [2022-07-21 15:46:51,232 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---kernel--locking--locktorture.ko.cil.i[244483,244496] [2022-07-21 15:46:51,232 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---kernel--locking--locktorture.ko.cil.i[244639,244652] [2022-07-21 15:46:51,232 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---kernel--locking--locktorture.ko.cil.i[244788,244801] [2022-07-21 15:46:51,233 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---kernel--locking--locktorture.ko.cil.i[244940,244953] [2022-07-21 15:46:51,234 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---kernel--locking--locktorture.ko.cil.i[245091,245104] [2022-07-21 15:46:51,234 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---kernel--locking--locktorture.ko.cil.i[245240,245253] [2022-07-21 15:46:51,235 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---kernel--locking--locktorture.ko.cil.i[245392,245405] [2022-07-21 15:46:51,235 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---kernel--locking--locktorture.ko.cil.i[245540,245553] [2022-07-21 15:46:51,240 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---kernel--locking--locktorture.ko.cil.i[245693,245706] [2022-07-21 15:46:51,240 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---kernel--locking--locktorture.ko.cil.i[245844,245857] [2022-07-21 15:46:51,241 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---kernel--locking--locktorture.ko.cil.i[245994,246007] [2022-07-21 15:46:51,241 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---kernel--locking--locktorture.ko.cil.i[246141,246154] [2022-07-21 15:46:51,241 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---kernel--locking--locktorture.ko.cil.i[246292,246305] [2022-07-21 15:46:51,242 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---kernel--locking--locktorture.ko.cil.i[246443,246456] [2022-07-21 15:46:51,243 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---kernel--locking--locktorture.ko.cil.i[246591,246604] [2022-07-21 15:46:51,243 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---kernel--locking--locktorture.ko.cil.i[246757,246770] [2022-07-21 15:46:51,243 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---kernel--locking--locktorture.ko.cil.i[246926,246939] [2022-07-21 15:46:51,244 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---kernel--locking--locktorture.ko.cil.i[247093,247106] [2022-07-21 15:46:51,244 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---kernel--locking--locktorture.ko.cil.i[247261,247274] [2022-07-21 15:46:51,244 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---kernel--locking--locktorture.ko.cil.i[247411,247424] [2022-07-21 15:46:51,244 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---kernel--locking--locktorture.ko.cil.i[247558,247571] [2022-07-21 15:46:51,245 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---kernel--locking--locktorture.ko.cil.i[247719,247732] [2022-07-21 15:46:51,267 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---kernel--locking--locktorture.ko.cil.i[247889,247902] [2022-07-21 15:46:51,267 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---kernel--locking--locktorture.ko.cil.i[248051,248064] [2022-07-21 15:46:51,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:46:51,452 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:46:51,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51 WrapperNode [2022-07-21 15:46:51,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:46:51,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:46:51,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:46:51,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:46:51,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,633 INFO L137 Inliner]: procedures = 486, calls = 1092, calls flagged for inlining = 196, calls inlined = 121, statements flattened = 1951 [2022-07-21 15:46:51,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:46:51,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:46:51,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:46:51,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:46:51,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:46:51,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:46:51,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:46:51,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:46:51,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (1/1) ... [2022-07-21 15:46:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:46:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:51,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-21 15:46:51,833 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-21 15:46:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-21 15:46:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:46:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:46:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:46:51,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:46:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-07-21 15:46:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-07-21 15:46:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:46:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:46:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-07-21 15:46:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-07-21 15:46:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_lock [2022-07-21 15:46:51,851 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_lock [2022-07-21 15:46:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:46:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:46:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-07-21 15:46:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-07-21 15:46:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:46:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:46:51,853 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-07-21 15:46:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-07-21 15:46:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:46:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:46:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-07-21 15:46:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-07-21 15:46:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:46:51,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:46:51,854 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_delay [2022-07-21 15:46:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_delay [2022-07-21 15:46:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_delay [2022-07-21 15:46:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_delay [2022-07-21 15:46:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:46:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:46:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:46:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:46:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:46:51,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:46:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-07-21 15:46:51,856 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-07-21 15:46:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:46:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-21 15:46:51,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_unlock [2022-07-21 15:46:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 15:46:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 15:46:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:46:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:46:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_lock_irq [2022-07-21 15:46:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_lock_irq [2022-07-21 15:46:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-07-21 15:46:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-07-21 15:46:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:46:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:46:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:46:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:46:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:46:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:46:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:46:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:46:51,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:46:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:46:51,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:46:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:46:51,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:46:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-21 15:46:51,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_torture_spinlock [2022-07-21 15:46:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:46:51,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:46:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_write [2022-07-21 15:46:51,860 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_write [2022-07-21 15:46:51,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:46:51,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:46:51,861 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2022-07-21 15:46:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2022-07-21 15:46:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:46:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:46:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-21 15:46:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_write_lock [2022-07-21 15:46:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:46:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_read [2022-07-21 15:46:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_read [2022-07-21 15:46:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-07-21 15:46:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-07-21 15:46:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure torture_mutex_unlock [2022-07-21 15:46:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_mutex_unlock [2022-07-21 15:46:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:46:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_up_write [2022-07-21 15:46:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_up_write [2022-07-21 15:46:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:46:51,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:46:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_unlock_irq [2022-07-21 15:46:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_unlock_irq [2022-07-21 15:46:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:46:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:46:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:46:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-07-21 15:46:51,867 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-07-21 15:46:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:46:51,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:46:51,880 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_down_read [2022-07-21 15:46:51,880 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_down_read [2022-07-21 15:46:51,880 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_write_delay [2022-07-21 15:46:51,880 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_write_delay [2022-07-21 15:46:51,880 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-07-21 15:46:51,880 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-07-21 15:46:51,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:46:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:46:51,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:46:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:46:51,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:46:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:46:51,881 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-07-21 15:46:51,881 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-07-21 15:46:51,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-21 15:46:51,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_torture_mutex [2022-07-21 15:46:51,882 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock_irq [2022-07-21 15:46:51,882 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock_irq [2022-07-21 15:46:51,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:46:51,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:46:51,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:46:51,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:46:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:46:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:46:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:46:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:46:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:46:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-21 15:46:51,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_read_lock [2022-07-21 15:46:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 15:46:51,884 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 15:46:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:46:51,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:46:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-07-21 15:46:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-07-21 15:46:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock_irq [2022-07-21 15:46:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock_irq [2022-07-21 15:46:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:46:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:46:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:46:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:46:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwsem_read_delay [2022-07-21 15:46:51,885 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwsem_read_delay [2022-07-21 15:46:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:46:51,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:46:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2022-07-21 15:46:51,886 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2022-07-21 15:46:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:46:51,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:46:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_read_delay [2022-07-21 15:46:51,887 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_read_delay [2022-07-21 15:46:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:46:51,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:46:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:46:51,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:46:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:46:51,887 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:46:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:46:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:46:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:46:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:46:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:46:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-07-21 15:46:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-07-21 15:46:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:46:51,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:46:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure __torture_print_stats [2022-07-21 15:46:51,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __torture_print_stats [2022-07-21 15:46:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-21 15:46:51,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_torture_spinlock [2022-07-21 15:46:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:46:51,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:46:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_unlock [2022-07-21 15:46:51,890 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_unlock [2022-07-21 15:46:51,890 INFO L130 BoogieDeclarations]: Found specification of procedure torture_rwlock_write_lock [2022-07-21 15:46:51,890 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_rwlock_write_lock [2022-07-21 15:46:51,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:46:52,351 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:46:52,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:46:52,567 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:46:53,638 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:46:53,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:46:53,651 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:46:53,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:46:53 BoogieIcfgContainer [2022-07-21 15:46:53,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:46:53,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:46:53,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:46:53,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:46:53,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:46:49" (1/3) ... [2022-07-21 15:46:53,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30734c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:46:53, skipping insertion in model container [2022-07-21 15:46:53,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:51" (2/3) ... [2022-07-21 15:46:53,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30734c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:46:53, skipping insertion in model container [2022-07-21 15:46:53,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:46:53" (3/3) ... [2022-07-21 15:46:53,660 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---kernel--locking--locktorture.ko.cil.i [2022-07-21 15:46:53,671 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:46:53,673 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-21 15:46:53,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:46:53,744 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@66689922, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32698acd [2022-07-21 15:46:53,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-21 15:46:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) [2022-07-21 15:46:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 15:46:53,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:53,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:53,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === 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 29 more)] === [2022-07-21 15:46:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -192389351, now seen corresponding path program 1 times [2022-07-21 15:46:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:53,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571472027] [2022-07-21 15:46:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:46:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:54,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571472027] [2022-07-21 15:46:54,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571472027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:54,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:54,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 15:46:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924536356] [2022-07-21 15:46:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:54,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:46:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:46:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 15:46:54,319 INFO L87 Difference]: Start difference. First operand has 959 states, 646 states have (on average 1.3095975232198143) internal successors, (846), 706 states have internal predecessors, (846), 201 states have call successors, (201), 81 states have call predecessors, (201), 80 states have return successors, (193), 185 states have call predecessors, (193), 193 states have call successors, (193) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 15:46:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:54,636 INFO L93 Difference]: Finished difference Result 2259 states and 3174 transitions. [2022-07-21 15:46:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:46:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-21 15:46:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:54,658 INFO L225 Difference]: With dead ends: 2259 [2022-07-21 15:46:54,658 INFO L226 Difference]: Without dead ends: 1290 [2022-07-21 15:46:54,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 15:46:54,673 INFO L413 NwaCegarLoop]: 1628 mSDtfsCounter, 314 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:54,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2914 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 15:46:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-07-21 15:46:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 945. [2022-07-21 15:46:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 642 states have (on average 1.2523364485981308) internal successors, (804), 695 states have internal predecessors, (804), 193 states have call successors, (193), 80 states have call predecessors, (193), 79 states have return successors, (191), 183 states have call predecessors, (191), 191 states have call successors, (191) [2022-07-21 15:46:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1188 transitions. [2022-07-21 15:46:54,778 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1188 transitions. Word has length 26 [2022-07-21 15:46:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:54,779 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1188 transitions. [2022-07-21 15:46:54,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 15:46:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1188 transitions. [2022-07-21 15:46:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 15:46:54,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:54,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:54,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:46:54,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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 29 more)] === [2022-07-21 15:46:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789480, now seen corresponding path program 1 times [2022-07-21 15:46:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:54,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65365473] [2022-07-21 15:46:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:46:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:55,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65365473] [2022-07-21 15:46:55,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65365473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:55,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:55,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:46:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367724342] [2022-07-21 15:46:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:55,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:46:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:46:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:46:55,143 INFO L87 Difference]: Start difference. First operand 945 states and 1188 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 15:46:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:57,552 INFO L93 Difference]: Finished difference Result 2964 states and 3704 transitions. [2022-07-21 15:46:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:46:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-21 15:46:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:57,565 INFO L225 Difference]: With dead ends: 2964 [2022-07-21 15:46:57,565 INFO L226 Difference]: Without dead ends: 2053 [2022-07-21 15:46:57,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:46:57,570 INFO L413 NwaCegarLoop]: 1736 mSDtfsCounter, 1437 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 10022 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:57,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 10022 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:46:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-07-21 15:46:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1793. [2022-07-21 15:46:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1244 states have (on average 1.2532154340836013) internal successors, (1559), 1317 states have internal predecessors, (1559), 355 states have call successors, (355), 165 states have call predecessors, (355), 163 states have return successors, (362), 337 states have call predecessors, (362), 353 states have call successors, (362) [2022-07-21 15:46:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2276 transitions. [2022-07-21 15:46:57,654 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2276 transitions. Word has length 28 [2022-07-21 15:46:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:57,655 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2276 transitions. [2022-07-21 15:46:57,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 15:46:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2276 transitions. [2022-07-21 15:46:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 15:46:57,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:57,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:57,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:46:57,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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 29 more)] === [2022-07-21 15:46:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1675116871, now seen corresponding path program 1 times [2022-07-21 15:46:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:57,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003229266] [2022-07-21 15:46:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:46:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:58,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003229266] [2022-07-21 15:46:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003229266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:46:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639554676] [2022-07-21 15:46:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:58,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:58,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:58,147 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-21 15:46:58,179 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-21 15:46:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 15:46:58,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:46:58,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,825 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 15:46:58,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-21 15:46:58,848 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:46:58,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:46:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:46:58,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:46:59,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:46:59,022 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 16 treesize of output 18 [2022-07-21 15:46:59,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:46:59,155 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 25 treesize of output 20 [2022-07-21 15:46:59,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-21 15:46:59,274 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:46:59,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-21 15:46:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:46:59,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:04,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:47:04,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:04,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_175 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_176) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_176 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_175) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:04,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:47:04,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:47:04,227 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 241 treesize of output 233 [2022-07-21 15:47:04,232 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 228 treesize of output 226 [2022-07-21 15:47:04,281 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:04,282 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:04,412 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:04,413 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:04,501 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:04,501 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639554676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:04,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:04,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2022-07-21 15:47:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488978797] [2022-07-21 15:47:04,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:47:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 15:47:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 15:47:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=410, Unknown=9, NotChecked=126, Total=600 [2022-07-21 15:47:04,528 INFO L87 Difference]: Start difference. First operand 1793 states and 2276 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:08,932 INFO L93 Difference]: Finished difference Result 4142 states and 5271 transitions. [2022-07-21 15:47:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:47:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-21 15:47:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:08,947 INFO L225 Difference]: With dead ends: 4142 [2022-07-21 15:47:08,947 INFO L226 Difference]: Without dead ends: 2384 [2022-07-21 15:47:08,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=129, Invalid=804, Unknown=9, NotChecked=180, Total=1122 [2022-07-21 15:47:08,956 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 1992 mSDsluCounter, 16061 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:08,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 17561 Invalid, 5504 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [955 Valid, 4020 Invalid, 0 Unknown, 529 Unchecked, 3.6s Time] [2022-07-21 15:47:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-07-21 15:47:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2044. [2022-07-21 15:47:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1439 states have (on average 1.266851980542043) internal successors, (1823), 1513 states have internal predecessors, (1823), 395 states have call successors, (395), 181 states have call predecessors, (395), 179 states have return successors, (402), 375 states have call predecessors, (402), 393 states have call successors, (402) [2022-07-21 15:47:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2620 transitions. [2022-07-21 15:47:09,060 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2620 transitions. Word has length 31 [2022-07-21 15:47:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:09,061 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2620 transitions. [2022-07-21 15:47:09,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 17 states have internal predecessors, (48), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2620 transitions. [2022-07-21 15:47:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 15:47:09,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:09,064 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 15:47:09,093 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-21 15:47:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:09,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 29 more)] === [2022-07-21 15:47:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 356279481, now seen corresponding path program 1 times [2022-07-21 15:47:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638352508] [2022-07-21 15:47:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638352508] [2022-07-21 15:47:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638352508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483478754] [2022-07-21 15:47:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:09,456 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-21 15:47:09,491 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-21 15:47:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:09,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 15:47:09,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:10,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:47:10,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:10,073 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 15:47:10,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-21 15:47:10,094 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:47:10,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:47:10,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:10,243 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 16 treesize of output 18 [2022-07-21 15:47:10,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:47:10,328 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 25 treesize of output 20 [2022-07-21 15:47:10,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-07-21 15:47:10,441 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:47:10,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-07-21 15:47:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:10,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:17,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:17,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_286) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_286 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_285) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:17,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:47:17,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:47:17,886 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 241 treesize of output 233 [2022-07-21 15:47:17,896 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 228 treesize of output 226 [2022-07-21 15:47:17,933 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:17,933 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:18,067 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:18,067 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:18,142 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:18,143 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:18,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483478754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:18,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:18,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2022-07-21 15:47:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141638747] [2022-07-21 15:47:18,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:47:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:47:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:47:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=253, Unknown=10, NotChecked=66, Total=380 [2022-07-21 15:47:18,166 INFO L87 Difference]: Start difference. First operand 2044 states and 2620 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:25,221 INFO L93 Difference]: Finished difference Result 6736 states and 9287 transitions. [2022-07-21 15:47:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 15:47:25,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-21 15:47:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:25,249 INFO L225 Difference]: With dead ends: 6736 [2022-07-21 15:47:25,250 INFO L226 Difference]: Without dead ends: 5516 [2022-07-21 15:47:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=174, Invalid=694, Unknown=10, NotChecked=114, Total=992 [2022-07-21 15:47:25,256 INFO L413 NwaCegarLoop]: 3133 mSDtfsCounter, 3152 mSDsluCounter, 22071 mSDsCounter, 0 mSdLazyCounter, 6685 mSolverCounterSat, 838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 25204 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 6685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:25,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3473 Valid, 25204 Invalid, 8569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [838 Valid, 6685 Invalid, 0 Unknown, 1046 Unchecked, 6.1s Time] [2022-07-21 15:47:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2022-07-21 15:47:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 2122. [2022-07-21 15:47:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1506 states have (on average 1.2755644090305445) internal successors, (1921), 1581 states have internal predecessors, (1921), 406 states have call successors, (406), 181 states have call predecessors, (406), 179 states have return successors, (413), 385 states have call predecessors, (413), 404 states have call successors, (413) [2022-07-21 15:47:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2740 transitions. [2022-07-21 15:47:25,428 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2740 transitions. Word has length 32 [2022-07-21 15:47:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:25,429 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 2740 transitions. [2022-07-21 15:47:25,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2740 transitions. [2022-07-21 15:47:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 15:47:25,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:25,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-21 15:47:25,463 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-21 15:47:25,652 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,SelfDestructingSolverStorable3 [2022-07-21 15:47:25,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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 29 more)] === [2022-07-21 15:47:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1407947960, now seen corresponding path program 2 times [2022-07-21 15:47:25,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:25,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648735138] [2022-07-21 15:47:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:26,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648735138] [2022-07-21 15:47:26,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648735138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:26,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654812242] [2022-07-21 15:47:26,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 15:47:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:26,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:26,097 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-21 15:47:26,131 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-21 15:47:26,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 15:47:26,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:47:26,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 15:47:26,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:26,688 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:47:26,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:47:26,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:47:26,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:26,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:47:26,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:26,883 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 16 treesize of output 18 [2022-07-21 15:47:26,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:26,967 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 16 treesize of output 18 [2022-07-21 15:47:27,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:47:27,037 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 25 treesize of output 20 [2022-07-21 15:47:27,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-21 15:47:27,143 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:47:27,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 15:47:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:27,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:33,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:33,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:33,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_410 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_409) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_409 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_410) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:33,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:47:33,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:47:33,213 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 241 treesize of output 233 [2022-07-21 15:47:33,218 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 228 treesize of output 226 [2022-07-21 15:47:33,245 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:33,246 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:33,361 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:33,361 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:33,425 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:33,425 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:33,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654812242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:33,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:33,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-21 15:47:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300880099] [2022-07-21 15:47:33,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:47:33,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 15:47:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 15:47:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=434, Unknown=11, NotChecked=132, Total=650 [2022-07-21 15:47:33,455 INFO L87 Difference]: Start difference. First operand 2122 states and 2740 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:37,368 INFO L93 Difference]: Finished difference Result 4527 states and 5850 transitions. [2022-07-21 15:47:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:47:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-07-21 15:47:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:37,382 INFO L225 Difference]: With dead ends: 4527 [2022-07-21 15:47:37,383 INFO L226 Difference]: Without dead ends: 3326 [2022-07-21 15:47:37,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=143, Invalid=728, Unknown=11, NotChecked=174, Total=1056 [2022-07-21 15:47:37,388 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 2154 mSDsluCounter, 17206 mSDsCounter, 0 mSdLazyCounter, 4260 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 18699 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 4260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:37,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 18699 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 4260 Invalid, 0 Unknown, 551 Unchecked, 3.4s Time] [2022-07-21 15:47:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-07-21 15:47:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2416. [2022-07-21 15:47:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1732 states have (on average 1.2869515011547343) internal successors, (2229), 1810 states have internal predecessors, (2229), 455 states have call successors, (455), 200 states have call predecessors, (455), 198 states have return successors, (464), 431 states have call predecessors, (464), 453 states have call successors, (464) [2022-07-21 15:47:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3148 transitions. [2022-07-21 15:47:37,576 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3148 transitions. Word has length 34 [2022-07-21 15:47:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:37,576 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 3148 transitions. [2022-07-21 15:47:37,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3148 transitions. [2022-07-21 15:47:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 15:47:37,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:37,577 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 15:47:37,606 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-21 15:47:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:37,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 29 more)] === [2022-07-21 15:47:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash 663977832, now seen corresponding path program 2 times [2022-07-21 15:47:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630043904] [2022-07-21 15:47:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630043904] [2022-07-21 15:47:37,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630043904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813184241] [2022-07-21 15:47:37,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 15:47:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:37,967 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-21 15:47:37,969 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-21 15:47:38,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 15:47:38,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:47:38,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 15:47:38,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:38,622 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:47:38,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:47:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:47:38,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:38,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:47:38,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:38,801 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 16 treesize of output 18 [2022-07-21 15:47:38,861 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 16 treesize of output 18 [2022-07-21 15:47:38,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:38,948 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 25 treesize of output 20 [2022-07-21 15:47:38,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:47:39,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-21 15:47:39,049 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:47:39,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-21 15:47:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:39,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:45,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:47:45,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:45,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:45,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_533 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_533) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_533 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_534) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:45,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:47:45,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:47:45,209 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 241 treesize of output 233 [2022-07-21 15:47:45,213 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 228 treesize of output 226 [2022-07-21 15:47:45,249 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:45,249 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:45,346 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:45,346 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:45,396 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:45,396 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813184241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:45,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2022-07-21 15:47:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48943114] [2022-07-21 15:47:45,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:47:45,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 15:47:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:45,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 15:47:45,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=289, Unknown=9, NotChecked=148, Total=506 [2022-07-21 15:47:45,415 INFO L87 Difference]: Start difference. First operand 2416 states and 3148 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:50,625 INFO L93 Difference]: Finished difference Result 8549 states and 11926 transitions. [2022-07-21 15:47:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 15:47:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-07-21 15:47:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:50,662 INFO L225 Difference]: With dead ends: 8549 [2022-07-21 15:47:50,662 INFO L226 Difference]: Without dead ends: 6764 [2022-07-21 15:47:50,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=158, Invalid=719, Unknown=9, NotChecked=236, Total=1122 [2022-07-21 15:47:50,670 INFO L413 NwaCegarLoop]: 4072 mSDtfsCounter, 4008 mSDsluCounter, 22759 mSDsCounter, 0 mSdLazyCounter, 5855 mSolverCounterSat, 1453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 26831 SdHoareTripleChecker+Invalid, 8834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1453 IncrementalHoareTripleChecker+Valid, 5855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1526 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:50,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 26831 Invalid, 8834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1453 Valid, 5855 Invalid, 0 Unknown, 1526 Unchecked, 4.2s Time] [2022-07-21 15:47:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2022-07-21 15:47:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 2426. [2022-07-21 15:47:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1740 states have (on average 1.2862068965517242) internal successors, (2238), 1819 states have internal predecessors, (2238), 456 states have call successors, (456), 201 states have call predecessors, (456), 199 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2022-07-21 15:47:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3159 transitions. [2022-07-21 15:47:50,889 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3159 transitions. Word has length 35 [2022-07-21 15:47:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:50,889 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 3159 transitions. [2022-07-21 15:47:50,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3159 transitions. [2022-07-21 15:47:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 15:47:50,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:50,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:50,921 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-21 15:47:51,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:51,118 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 29 more)] === [2022-07-21 15:47:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1168508767, now seen corresponding path program 1 times [2022-07-21 15:47:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:51,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900165543] [2022-07-21 15:47:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:51,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 15:47:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900165543] [2022-07-21 15:47:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900165543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:51,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:51,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 15:47:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575104023] [2022-07-21 15:47:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:47:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:47:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 15:47:51,320 INFO L87 Difference]: Start difference. First operand 2426 states and 3159 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:51,481 INFO L93 Difference]: Finished difference Result 4644 states and 6062 transitions. [2022-07-21 15:47:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:47:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-07-21 15:47:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:51,491 INFO L225 Difference]: With dead ends: 4644 [2022-07-21 15:47:51,491 INFO L226 Difference]: Without dead ends: 2426 [2022-07-21 15:47:51,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 15:47:51,499 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 1167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1178 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-21 15:47:51,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1178 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:47:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2022-07-21 15:47:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2426. [2022-07-21 15:47:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1740 states have (on average 1.2775862068965518) internal successors, (2223), 1819 states have internal predecessors, (2223), 456 states have call successors, (456), 201 states have call predecessors, (456), 199 states have return successors, (465), 431 states have call predecessors, (465), 454 states have call successors, (465) [2022-07-21 15:47:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3144 transitions. [2022-07-21 15:47:51,709 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3144 transitions. Word has length 36 [2022-07-21 15:47:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:51,710 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 3144 transitions. [2022-07-21 15:47:51,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:47:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3144 transitions. [2022-07-21 15:47:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 15:47:51,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:51,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-21 15:47:51,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:47:51,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 29 more)] === [2022-07-21 15:47:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 753319847, now seen corresponding path program 3 times [2022-07-21 15:47:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501677096] [2022-07-21 15:47:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501677096] [2022-07-21 15:47:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501677096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742129700] [2022-07-21 15:47:52,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 15:47:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:52,252 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-21 15:47:52,258 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-21 15:47:52,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 15:47:52,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:47:52,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 15:47:52,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:52,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,985 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 15:47:52,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-21 15:47:52,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:52,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:53,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:47:53,020 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:47:53,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:47:53,129 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 16 treesize of output 18 [2022-07-21 15:47:53,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:53,194 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 16 treesize of output 18 [2022-07-21 15:47:53,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:53,263 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 16 treesize of output 18 [2022-07-21 15:47:53,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:47:53,334 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 25 treesize of output 20 [2022-07-21 15:47:53,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:47:53,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-21 15:47:53,436 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:47:53,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 15:47:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:47:53,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:57,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:47:57,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:57,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:57,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:57,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_727) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_727 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_728) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:47:57,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:47:57,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:47:57,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 241 treesize of output 233 [2022-07-21 15:47:57,139 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 228 treesize of output 226 [2022-07-21 15:47:57,176 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:57,176 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:57,298 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:57,299 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:57,367 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:47:57,368 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:47:57,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742129700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:57,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:57,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-21 15:47:57,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706549235] [2022-07-21 15:47:57,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:47:57,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 15:47:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:57,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 15:47:57,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=447, Unknown=9, NotChecked=230, Total=756 [2022-07-21 15:47:57,395 INFO L87 Difference]: Start difference. First operand 2426 states and 3144 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:03,089 INFO L93 Difference]: Finished difference Result 4972 states and 6491 transitions. [2022-07-21 15:48:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:48:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-21 15:48:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:03,104 INFO L225 Difference]: With dead ends: 4972 [2022-07-21 15:48:03,104 INFO L226 Difference]: Without dead ends: 3771 [2022-07-21 15:48:03,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=151, Invalid=790, Unknown=9, NotChecked=310, Total=1260 [2022-07-21 15:48:03,108 INFO L413 NwaCegarLoop]: 1544 mSDtfsCounter, 2323 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 6540 mSolverCounterSat, 1121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 18046 SdHoareTripleChecker+Invalid, 7687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1121 IncrementalHoareTripleChecker+Valid, 6540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:03,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 18046 Invalid, 7687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1121 Valid, 6540 Invalid, 0 Unknown, 26 Unchecked, 4.9s Time] [2022-07-21 15:48:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2022-07-21 15:48:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 2721. [2022-07-21 15:48:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2721 states, 1968 states have (on average 1.2860772357723578) internal successors, (2531), 2049 states have internal predecessors, (2531), 504 states have call successors, (504), 220 states have call predecessors, (504), 218 states have return successors, (515), 477 states have call predecessors, (515), 502 states have call successors, (515) [2022-07-21 15:48:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3550 transitions. [2022-07-21 15:48:03,341 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3550 transitions. Word has length 37 [2022-07-21 15:48:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:03,341 INFO L495 AbstractCegarLoop]: Abstraction has 2721 states and 3550 transitions. [2022-07-21 15:48:03,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3550 transitions. [2022-07-21 15:48:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 15:48:03,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:03,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-21 15:48:03,371 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-21 15:48:03,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:03,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 29 more)] === [2022-07-21 15:48:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1845342809, now seen corresponding path program 3 times [2022-07-21 15:48:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:03,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173192487] [2022-07-21 15:48:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:03,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173192487] [2022-07-21 15:48:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173192487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:03,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164171718] [2022-07-21 15:48:03,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 15:48:03,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:03,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:48:03,708 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-21 15:48:03,718 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-21 15:48:04,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-21 15:48:04,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:48:04,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 15:48:04,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:48:04,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,501 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 15:48:04,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 22 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-21 15:48:04,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:04,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:48:04,548 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:48:04,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:48:04,681 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 15:48:04,681 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 30 treesize of output 33 [2022-07-21 15:48:04,688 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-21 15:48:04,751 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-21 15:48:04,762 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 15:48:04,763 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 30 treesize of output 33 [2022-07-21 15:48:04,826 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 15:48:04,826 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 30 treesize of output 33 [2022-07-21 15:48:04,843 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-21 15:48:04,916 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 15:48:04,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2022-07-21 15:48:04,919 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 25 treesize of output 20 [2022-07-21 15:48:05,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:05,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 15:48:05,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:05,042 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-21 15:48:05,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 26 [2022-07-21 15:48:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:05,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:48:05,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:05,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:05,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-21 15:48:05,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_867) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_867 (+ |c_~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_866) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:05,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:48:05,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:48:05,278 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 241 treesize of output 233 [2022-07-21 15:48:05,282 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 228 treesize of output 226 [2022-07-21 15:48:05,315 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:05,316 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:05,429 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:05,429 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:05,502 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:05,502 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:05,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164171718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:05,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:48:05,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2022-07-21 15:48:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577967035] [2022-07-21 15:48:05,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:48:05,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 15:48:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 15:48:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=403, Unknown=4, NotChecked=172, Total=650 [2022-07-21 15:48:05,521 INFO L87 Difference]: Start difference. First operand 2721 states and 3550 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:14,648 INFO L93 Difference]: Finished difference Result 10237 states and 14400 transitions. [2022-07-21 15:48:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 15:48:14,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-07-21 15:48:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:14,680 INFO L225 Difference]: With dead ends: 10237 [2022-07-21 15:48:14,680 INFO L226 Difference]: Without dead ends: 8450 [2022-07-21 15:48:14,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=1013, Unknown=4, NotChecked=276, Total=1482 [2022-07-21 15:48:14,687 INFO L413 NwaCegarLoop]: 4633 mSDtfsCounter, 4264 mSDsluCounter, 36022 mSDsCounter, 0 mSdLazyCounter, 10297 mSolverCounterSat, 1316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4798 SdHoareTripleChecker+Valid, 40655 SdHoareTripleChecker+Invalid, 13236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1316 IncrementalHoareTripleChecker+Valid, 10297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1623 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:14,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4798 Valid, 40655 Invalid, 13236 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1316 Valid, 10297 Invalid, 0 Unknown, 1623 Unchecked, 7.5s Time] [2022-07-21 15:48:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8450 states. [2022-07-21 15:48:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8450 to 3010. [2022-07-21 15:48:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2166 states have (on average 1.2774699907663896) internal successors, (2767), 2250 states have internal predecessors, (2767), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:48:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3896 transitions. [2022-07-21 15:48:15,018 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3896 transitions. Word has length 38 [2022-07-21 15:48:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:15,018 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 3896 transitions. [2022-07-21 15:48:15,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3896 transitions. [2022-07-21 15:48:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 15:48:15,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:15,019 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 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-21 15:48:15,039 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-21 15:48:15,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:15,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 29 more)] === [2022-07-21 15:48:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2121270696, now seen corresponding path program 4 times [2022-07-21 15:48:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:15,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942703487] [2022-07-21 15:48:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942703487] [2022-07-21 15:48:15,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942703487] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275026203] [2022-07-21 15:48:15,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 15:48:15,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:48:15,606 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-21 15:48:15,630 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-21 15:48:16,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 15:48:16,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:48:16,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 15:48:16,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:48:16,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,143 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 15:48:16,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 76 [2022-07-21 15:48:16,162 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:48:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:48:16,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:16,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:48:16,312 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 16 treesize of output 18 [2022-07-21 15:48:16,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:16,398 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 16 treesize of output 18 [2022-07-21 15:48:16,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:16,482 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 16 treesize of output 18 [2022-07-21 15:48:16,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:16,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:16,576 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 16 treesize of output 18 [2022-07-21 15:48:16,656 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 25 treesize of output 20 [2022-07-21 15:48:16,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:48:16,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-07-21 15:48:16,758 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:48:16,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-21 15:48:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:16,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:48:20,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:48:20,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:48:20,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:48:20,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:48:20,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:48:20,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1018) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1018 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1019) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:48:20,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:48:20,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:48:20,515 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 241 treesize of output 233 [2022-07-21 15:48:20,520 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 228 treesize of output 226 [2022-07-21 15:48:20,559 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:20,560 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:20,690 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:20,690 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:20,761 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:20,761 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:20,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275026203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:20,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:48:20,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-21 15:48:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095995265] [2022-07-21 15:48:20,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:48:20,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 15:48:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 15:48:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=528, Unknown=8, NotChecked=306, Total=930 [2022-07-21 15:48:20,790 INFO L87 Difference]: Start difference. First operand 3010 states and 3896 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:25,728 INFO L93 Difference]: Finished difference Result 6232 states and 8179 transitions. [2022-07-21 15:48:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:48:25,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-07-21 15:48:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:25,751 INFO L225 Difference]: With dead ends: 6232 [2022-07-21 15:48:25,751 INFO L226 Difference]: Without dead ends: 4530 [2022-07-21 15:48:25,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=173, Invalid=899, Unknown=8, NotChecked=402, Total=1482 [2022-07-21 15:48:25,757 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2598 mSDsluCounter, 15645 mSDsCounter, 0 mSdLazyCounter, 5620 mSolverCounterSat, 1243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 17237 SdHoareTripleChecker+Invalid, 7509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1243 IncrementalHoareTripleChecker+Valid, 5620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:25,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 17237 Invalid, 7509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1243 Valid, 5620 Invalid, 0 Unknown, 646 Unchecked, 4.0s Time] [2022-07-21 15:48:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2022-07-21 15:48:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 3012. [2022-07-21 15:48:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 2168 states have (on average 1.2776752767527675) internal successors, (2770), 2252 states have internal predecessors, (2770), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:48:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3899 transitions. [2022-07-21 15:48:26,054 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3899 transitions. Word has length 40 [2022-07-21 15:48:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:26,054 INFO L495 AbstractCegarLoop]: Abstraction has 3012 states and 3899 transitions. [2022-07-21 15:48:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3899 transitions. [2022-07-21 15:48:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 15:48:26,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:26,057 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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-21 15:48:26,085 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-21 15:48:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:26,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 29 more)] === [2022-07-21 15:48:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1367618104, now seen corresponding path program 4 times [2022-07-21 15:48:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:26,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855344056] [2022-07-21 15:48:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855344056] [2022-07-21 15:48:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855344056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164042861] [2022-07-21 15:48:26,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 15:48:26,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:48:26,437 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-21 15:48:26,463 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-21 15:48:26,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 15:48:26,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:48:26,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 15:48:26,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:48:26,924 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:48:26,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:48:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:48:26,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:26,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:48:27,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:27,054 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 16 treesize of output 18 [2022-07-21 15:48:27,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:27,126 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 16 treesize of output 18 [2022-07-21 15:48:27,176 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 16 treesize of output 18 [2022-07-21 15:48:27,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:27,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:27,243 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 16 treesize of output 18 [2022-07-21 15:48:27,295 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 25 treesize of output 20 [2022-07-21 15:48:27,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:48:27,395 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-21 15:48:27,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 15:48:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:27,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:48:35,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:35,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:35,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:35,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:35,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|~#cxt~0.offset| Int) (v_ArrVal_1171 (Array Int Int))) (not (= (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1170) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1170 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1171) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:35,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:48:35,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:48:35,747 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 241 treesize of output 233 [2022-07-21 15:48:35,751 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 228 treesize of output 226 [2022-07-21 15:48:35,778 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:35,779 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:35,909 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:35,910 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:35,975 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:35,975 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:36,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164042861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:36,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:48:36,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-21 15:48:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356279205] [2022-07-21 15:48:36,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:48:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 15:48:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 15:48:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=484, Unknown=7, NotChecked=240, Total=812 [2022-07-21 15:48:36,008 INFO L87 Difference]: Start difference. First operand 3012 states and 3899 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:45,386 INFO L93 Difference]: Finished difference Result 9654 states and 13729 transitions. [2022-07-21 15:48:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 15:48:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-07-21 15:48:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:45,413 INFO L225 Difference]: With dead ends: 9654 [2022-07-21 15:48:45,413 INFO L226 Difference]: Without dead ends: 7867 [2022-07-21 15:48:45,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=261, Invalid=1474, Unknown=7, NotChecked=420, Total=2162 [2022-07-21 15:48:45,421 INFO L413 NwaCegarLoop]: 5510 mSDtfsCounter, 4907 mSDsluCounter, 45330 mSDsCounter, 0 mSdLazyCounter, 11732 mSolverCounterSat, 1446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5546 SdHoareTripleChecker+Valid, 50840 SdHoareTripleChecker+Invalid, 15254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1446 IncrementalHoareTripleChecker+Valid, 11732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2076 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:45,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5546 Valid, 50840 Invalid, 15254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1446 Valid, 11732 Invalid, 0 Unknown, 2076 Unchecked, 7.2s Time] [2022-07-21 15:48:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-07-21 15:48:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 3020. [2022-07-21 15:48:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2176 states have (on average 1.2766544117647058) internal successors, (2778), 2260 states have internal predecessors, (2778), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:48:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 3907 transitions. [2022-07-21 15:48:45,791 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 3907 transitions. Word has length 41 [2022-07-21 15:48:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:45,791 INFO L495 AbstractCegarLoop]: Abstraction has 3020 states and 3907 transitions. [2022-07-21 15:48:45,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:48:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3907 transitions. [2022-07-21 15:48:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 15:48:45,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:45,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:48:45,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 15:48:45,993 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,SelfDestructingSolverStorable10 [2022-07-21 15:48:45,994 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 29 more)] === [2022-07-21 15:48:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1262413276, now seen corresponding path program 1 times [2022-07-21 15:48:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:45,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109285539] [2022-07-21 15:48:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 15:48:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:46,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109285539] [2022-07-21 15:48:46,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109285539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:46,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:46,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 15:48:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88392171] [2022-07-21 15:48:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 15:48:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 15:48:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 15:48:46,075 INFO L87 Difference]: Start difference. First operand 3020 states and 3907 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:48:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:46,469 INFO L93 Difference]: Finished difference Result 3104 states and 4020 transitions. [2022-07-21 15:48:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 15:48:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-21 15:48:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:46,479 INFO L225 Difference]: With dead ends: 3104 [2022-07-21 15:48:46,479 INFO L226 Difference]: Without dead ends: 3102 [2022-07-21 15:48:46,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-21 15:48:46,481 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 33 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:46,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:48:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2022-07-21 15:48:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3036. [2022-07-21 15:48:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 2192 states have (on average 1.2746350364963503) internal successors, (2794), 2276 states have internal predecessors, (2794), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:48:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 3923 transitions. [2022-07-21 15:48:46,830 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 3923 transitions. Word has length 43 [2022-07-21 15:48:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:46,831 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 3923 transitions. [2022-07-21 15:48:46,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:48:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3923 transitions. [2022-07-21 15:48:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 15:48:46,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:46,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:48:46,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:48:46,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 29 more)] === [2022-07-21 15:48:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1262472858, now seen corresponding path program 1 times [2022-07-21 15:48:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715216652] [2022-07-21 15:48:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 15:48:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:46,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715216652] [2022-07-21 15:48:46,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715216652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:46,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:46,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922015818] [2022-07-21 15:48:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:46,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:46,929 INFO L87 Difference]: Start difference. First operand 3036 states and 3923 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:48:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:47,612 INFO L93 Difference]: Finished difference Result 5763 states and 7556 transitions. [2022-07-21 15:48:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:48:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-21 15:48:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:47,621 INFO L225 Difference]: With dead ends: 5763 [2022-07-21 15:48:47,621 INFO L226 Difference]: Without dead ends: 3018 [2022-07-21 15:48:47,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:48:47,629 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1161 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:47,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4295 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 15:48:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2022-07-21 15:48:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2022-07-21 15:48:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2175 states have (on average 1.2694252873563219) internal successors, (2761), 2258 states have internal predecessors, (2761), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:48:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 3890 transitions. [2022-07-21 15:48:48,007 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 3890 transitions. Word has length 43 [2022-07-21 15:48:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:48,008 INFO L495 AbstractCegarLoop]: Abstraction has 3018 states and 3890 transitions. [2022-07-21 15:48:48,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:48:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3890 transitions. [2022-07-21 15:48:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 15:48:48,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:48,009 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 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-21 15:48:48,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:48:48,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 29 more)] === [2022-07-21 15:48:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1695222265, now seen corresponding path program 5 times [2022-07-21 15:48:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:48,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683729239] [2022-07-21 15:48:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683729239] [2022-07-21 15:48:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683729239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156329243] [2022-07-21 15:48:48,418 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 15:48:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:48:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:48:48,424 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-21 15:48:48,425 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-21 15:48:48,931 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-21 15:48:48,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:48:48,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 15:48:48,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:48:49,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:48:49,051 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:48:49,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:48:49,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:48:49,193 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 16 treesize of output 18 [2022-07-21 15:48:49,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:49,257 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 16 treesize of output 18 [2022-07-21 15:48:49,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:49,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:49,332 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 16 treesize of output 18 [2022-07-21 15:48:49,404 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 16 treesize of output 18 [2022-07-21 15:48:49,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:49,490 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 16 treesize of output 18 [2022-07-21 15:48:49,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:48:49,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:48:49,576 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 25 treesize of output 20 [2022-07-21 15:48:49,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:48:49,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 15:48:49,677 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-21 15:48:49,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 15:48:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:48:49,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:48:57,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:57,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:57,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-21 15:48:57,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.base| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)))))) is different from false [2022-07-21 15:48:57,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:57,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (select (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1448) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| (store v_ArrVal_1448 (+ |~#cxt~0.offset| 13) .cse0)) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1449) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) |#funAddr~torture_mutex_unlock.base|))) is different from false [2022-07-21 15:48:57,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:48:57,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:48:57,287 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 241 treesize of output 233 [2022-07-21 15:48:57,290 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 228 treesize of output 226 [2022-07-21 15:48:57,314 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:57,314 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:57,424 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:57,424 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:57,474 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:48:57,475 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:48:57,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156329243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:48:57,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:48:57,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-21 15:48:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490927224] [2022-07-21 15:48:57,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:48:57,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 15:48:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 15:48:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=15, NotChecked=366, Total=1260 [2022-07-21 15:48:57,501 INFO L87 Difference]: Start difference. First operand 3018 states and 3890 transitions. Second operand has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:49:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:05,478 INFO L93 Difference]: Finished difference Result 5832 states and 7692 transitions. [2022-07-21 15:49:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:49:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-21 15:49:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:05,491 INFO L225 Difference]: With dead ends: 5832 [2022-07-21 15:49:05,491 INFO L226 Difference]: Without dead ends: 4633 [2022-07-21 15:49:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=206, Invalid=1608, Unknown=16, NotChecked=522, Total=2352 [2022-07-21 15:49:05,496 INFO L413 NwaCegarLoop]: 1681 mSDtfsCounter, 2792 mSDsluCounter, 24015 mSDsCounter, 0 mSdLazyCounter, 9167 mSolverCounterSat, 1325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 25696 SdHoareTripleChecker+Invalid, 11167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1325 IncrementalHoareTripleChecker+Valid, 9167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:05,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 25696 Invalid, 11167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1325 Valid, 9167 Invalid, 0 Unknown, 675 Unchecked, 6.0s Time] [2022-07-21 15:49:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2022-07-21 15:49:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 3010. [2022-07-21 15:49:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2169 states have (on average 1.2701705855232825) internal successors, (2755), 2251 states have internal predecessors, (2755), 556 states have call successors, (556), 257 states have call predecessors, (556), 255 states have return successors, (571), 527 states have call predecessors, (571), 554 states have call successors, (571) [2022-07-21 15:49:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3882 transitions. [2022-07-21 15:49:05,954 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3882 transitions. Word has length 43 [2022-07-21 15:49:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:05,954 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 3882 transitions. [2022-07-21 15:49:05,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.272727272727273) internal successors, (72), 24 states have internal predecessors, (72), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:49:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3882 transitions. [2022-07-21 15:49:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 15:49:05,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:05,956 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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-21 15:49:05,966 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-21 15:49:06,164 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,SelfDestructingSolverStorable13 [2022-07-21 15:49:06,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 29 more)] === [2022-07-21 15:49:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1045018631, now seen corresponding path program 5 times [2022-07-21 15:49:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924217000] [2022-07-21 15:49:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:49:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:06,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924217000] [2022-07-21 15:49:06,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924217000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:49:06,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439137743] [2022-07-21 15:49:06,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 15:49:06,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:49:06,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:49:06,332 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-21 15:49:06,336 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-21 15:49:06,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-21 15:49:06,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:49:06,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 15:49:06,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:49:07,060 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 15:49:07,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 15:49:07,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:49:07,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:07,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 23 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:49:07,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, 2 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-21 15:49:07,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:07,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:07,293 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 16 treesize of output 18 [2022-07-21 15:49:07,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:07,367 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 16 treesize of output 18 [2022-07-21 15:49:07,433 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 16 treesize of output 18 [2022-07-21 15:49:07,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:07,511 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 16 treesize of output 18 [2022-07-21 15:49:07,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:07,604 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 25 treesize of output 20 [2022-07-21 15:49:07,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:49:07,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-21 15:49:07,738 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:49:07,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 15:49:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:49:07,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:49:13,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:49:13,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1614 (Array Int Int)) (|~#cxt~0.offset| Int)) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1614) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1614 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1615) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:49:13,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:49:13,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:49:13,147 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 241 treesize of output 233 [2022-07-21 15:49:13,152 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 228 treesize of output 226 [2022-07-21 15:49:13,186 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:49:13,187 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:49:13,303 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:49:13,303 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:49:13,389 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:49:13,390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:49:13,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439137743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:49:13,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:49:13,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2022-07-21 15:49:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074121565] [2022-07-21 15:49:13,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:49:13,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 15:49:13,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:13,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 15:49:13,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=530, Unknown=8, NotChecked=364, Total=992 [2022-07-21 15:49:13,414 INFO L87 Difference]: Start difference. First operand 3010 states and 3882 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:49:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:34,198 INFO L93 Difference]: Finished difference Result 12182 states and 17402 transitions. [2022-07-21 15:49:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 15:49:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-21 15:49:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:34,226 INFO L225 Difference]: With dead ends: 12182 [2022-07-21 15:49:34,226 INFO L226 Difference]: Without dead ends: 10393 [2022-07-21 15:49:34,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=245, Invalid=1497, Unknown=8, NotChecked=602, Total=2352 [2022-07-21 15:49:34,234 INFO L413 NwaCegarLoop]: 6412 mSDtfsCounter, 6006 mSDsluCounter, 59848 mSDsCounter, 0 mSdLazyCounter, 22451 mSolverCounterSat, 2397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6750 SdHoareTripleChecker+Valid, 66260 SdHoareTripleChecker+Invalid, 26795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2397 IncrementalHoareTripleChecker+Valid, 22451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1947 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6750 Valid, 66260 Invalid, 26795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2397 Valid, 22451 Invalid, 0 Unknown, 1947 Unchecked, 17.5s Time] [2022-07-21 15:49:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2022-07-21 15:49:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 3020. [2022-07-21 15:49:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2177 states have (on average 1.2691777675700506) internal successors, (2763), 2260 states have internal predecessors, (2763), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:49:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 3892 transitions. [2022-07-21 15:49:34,804 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 3892 transitions. Word has length 44 [2022-07-21 15:49:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:34,805 INFO L495 AbstractCegarLoop]: Abstraction has 3020 states and 3892 transitions. [2022-07-21 15:49:34,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 20 states have internal predecessors, (74), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:49:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3892 transitions. [2022-07-21 15:49:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 15:49:34,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:34,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:49:34,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-21 15:49:35,035 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,SelfDestructingSolverStorable14 [2022-07-21 15:49:35,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 29 more)] === [2022-07-21 15:49:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash -460727510, now seen corresponding path program 1 times [2022-07-21 15:49:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:35,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663089865] [2022-07-21 15:49:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 15:49:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:49:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:49:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:35,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663089865] [2022-07-21 15:49:35,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663089865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:35,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:35,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 15:49:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328048910] [2022-07-21 15:49:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:35,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:49:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:35,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:49:35,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 15:49:35,139 INFO L87 Difference]: Start difference. First operand 3020 states and 3892 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:49:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:35,607 INFO L93 Difference]: Finished difference Result 5729 states and 7492 transitions. [2022-07-21 15:49:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:49:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-07-21 15:49:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:35,616 INFO L225 Difference]: With dead ends: 5729 [2022-07-21 15:49:35,616 INFO L226 Difference]: Without dead ends: 3002 [2022-07-21 15:49:35,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 15:49:35,625 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:35,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:49:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-07-21 15:49:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-07-21 15:49:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2160 states have (on average 1.2638888888888888) internal successors, (2730), 2242 states have internal predecessors, (2730), 557 states have call successors, (557), 258 states have call predecessors, (557), 256 states have return successors, (572), 527 states have call predecessors, (572), 555 states have call successors, (572) [2022-07-21 15:49:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3859 transitions. [2022-07-21 15:49:36,058 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3859 transitions. Word has length 47 [2022-07-21 15:49:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:36,058 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 3859 transitions. [2022-07-21 15:49:36,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 15:49:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3859 transitions. [2022-07-21 15:49:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 15:49:36,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:36,061 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 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-21 15:49:36,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:49:36,062 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 29 more)] === [2022-07-21 15:49:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -914774024, now seen corresponding path program 6 times [2022-07-21 15:49:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:36,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973907273] [2022-07-21 15:49:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:49:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:36,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973907273] [2022-07-21 15:49:36,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973907273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:49:36,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170394967] [2022-07-21 15:49:36,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 15:49:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:49:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:49:36,528 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-21 15:49:36,530 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-21 15:49:37,780 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-21 15:49:37,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:49:37,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 233 conjunts are in the unsatisfiable core [2022-07-21 15:49:37,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:49:42,709 INFO L356 Elim1Store]: treesize reduction 328, result has 50.1 percent of original size [2022-07-21 15:49:42,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 83 select indices, 83 select index equivalence classes, 3321 disjoint index pairs (out of 3403 index pairs), introduced 83 new quantified variables, introduced 82 case distinctions, treesize of input 416 treesize of output 578 [2022-07-21 15:49:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 103 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 72 [2022-07-21 15:49:43,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:43,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 103 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2022-07-21 15:49:46,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:46,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:46,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:46,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:48,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:48,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:48,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:50,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:50,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:50,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:50,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:52,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:52,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:52,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:55,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:55,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:55,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:49:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:55,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:58,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:58,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 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-21 15:49:58,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:49:58,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-21 15:50:00,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:00,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:00,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 84 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-21 15:50:00,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:00,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 83 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-21 15:50:03,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:03,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 83 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-07-21 15:50:03,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:50:03,298 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 15:50:03,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 84 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 19 [2022-07-21 15:50:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:50:03,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:50:04,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:50:04,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#cxt~0.base|) (+ |~#cxt~0.offset| 13) .cse0)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0))) |#funAddr~torture_mutex_unlock.offset|))) is different from false [2022-07-21 15:50:04,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 8 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 16 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8) 24))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 32 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ 40 |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48 (* |c_ULTIMATE.start_lock_torture_init_~i~2#1| 8)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#cxt~0.offset| Int) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1850 (Array Int Int))) (not (= |#funAddr~torture_mutex_unlock.offset| (let ((.cse1 (+ |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.offset| 48))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| v_ArrVal_1850) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_~#cxt~0.base| (store v_ArrVal_1850 (+ |~#cxt~0.offset| 13) .cse0)) (select (select (store |c_#memory_$Pointer$.base| |c_~#cxt~0.base| v_ArrVal_1851) |c_ULTIMATE.start_lock_torture_init_~#torture_ops~0#1.base|) .cse1)) .cse0)))))) is different from false [2022-07-21 15:50:04,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:50:04,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 172 [2022-07-21 15:50:04,774 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 241 treesize of output 233 [2022-07-21 15:50:04,778 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 228 treesize of output 226 [2022-07-21 15:50:04,811 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:50:04,811 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:50:04,954 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:50:04,954 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:50:05,015 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-21 15:50:05,015 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-21 15:50:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170394967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:50:05,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:50:05,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-21 15:50:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855567614] [2022-07-21 15:50:05,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 15:50:05,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 15:50:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:50:05,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 15:50:05,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=676, Unknown=9, NotChecked=540, Total=1332 [2022-07-21 15:50:05,043 INFO L87 Difference]: Start difference. First operand 3002 states and 3859 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:50:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:50:41,153 INFO L93 Difference]: Finished difference Result 5913 states and 7827 transitions. [2022-07-21 15:50:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:50:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-21 15:50:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:50:41,163 INFO L225 Difference]: With dead ends: 5913 [2022-07-21 15:50:41,163 INFO L226 Difference]: Without dead ends: 4720 [2022-07-21 15:50:41,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=212, Invalid=1221, Unknown=9, NotChecked=720, Total=2162 [2022-07-21 15:50:41,168 INFO L413 NwaCegarLoop]: 1702 mSDtfsCounter, 2757 mSDsluCounter, 17207 mSDsCounter, 0 mSdLazyCounter, 7812 mSolverCounterSat, 1339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 18909 SdHoareTripleChecker+Invalid, 9177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1339 IncrementalHoareTripleChecker+Valid, 7812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:50:41,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 18909 Invalid, 9177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1339 Valid, 7812 Invalid, 0 Unknown, 26 Unchecked, 11.6s Time] [2022-07-21 15:50:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2022-07-21 15:50:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 2997. [2022-07-21 15:50:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2157 states have (on average 1.2651831247102456) internal successors, (2729), 2238 states have internal predecessors, (2729), 556 states have call successors, (556), 257 states have call predecessors, (556), 255 states have return successors, (571), 527 states have call predecessors, (571), 554 states have call successors, (571) [2022-07-21 15:50:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3856 transitions. [2022-07-21 15:50:41,973 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3856 transitions. Word has length 46 [2022-07-21 15:50:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:50:41,973 INFO L495 AbstractCegarLoop]: Abstraction has 2997 states and 3856 transitions. [2022-07-21 15:50:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 15:50:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3856 transitions. [2022-07-21 15:50:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 15:50:41,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:50:41,974 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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-21 15:50:41,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-21 15:50:42,174 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,SelfDestructingSolverStorable16 [2022-07-21 15:50:42,175 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 29 more)] === [2022-07-21 15:50:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:50:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1674040360, now seen corresponding path program 6 times [2022-07-21 15:50:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:50:42,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835913223] [2022-07-21 15:50:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:50:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:50:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:50:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:50:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 15:50:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:50:42,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835913223] [2022-07-21 15:50:42,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835913223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:50:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905709588] [2022-07-21 15:50:42,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 15:50:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:50:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:50:42,350 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-21 15:50:42,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process