/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:03:53,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:03:53,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:03:53,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:03:53,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:03:53,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:03:53,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:03:53,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:03:53,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:03:53,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:03:53,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:03:53,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:03:53,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:03:53,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:03:53,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:03:53,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:03:53,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:03:53,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:03:53,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:03:53,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:03:53,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:03:53,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:03:53,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:03:53,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:03:53,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:03:53,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:03:53,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:03:53,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:03:53,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:03:53,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:03:53,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:03:53,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:03:53,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:03:53,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:03:53,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:03:53,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:03:53,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:03:53,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:03:53,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:03:53,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:03:53,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:03:53,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 13:03:53,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:03:53,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:03:53,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:03:53,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:03:53,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:03:53,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:03:53,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:03:53,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:03:53,561 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:03:53,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:03:53,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:03:53,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:03:53,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:03:53,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:03:53,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:03:53,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:03:53,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:03:53,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:03:53,563 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:03:53,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:03:53,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:03:53,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:03:53,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:03:53,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:03:53,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:03:53,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:03:53,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:03:53,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:03:53,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:03:53,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:03:53,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:03:53,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:03:53,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:03:53,566 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 [2022-10-16 13:03:53,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:03:53,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:03:53,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:03:53,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:03:53,946 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:03:53,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-10-16 13:03:54,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478ac092e/2bceca4e8b7d427ca0b26fe5b809eb71/FLAGe2aaa0097 [2022-10-16 13:03:54,911 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:03:54,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-10-16 13:03:54,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478ac092e/2bceca4e8b7d427ca0b26fe5b809eb71/FLAGe2aaa0097 [2022-10-16 13:03:55,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478ac092e/2bceca4e8b7d427ca0b26fe5b809eb71 [2022-10-16 13:03:55,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:03:55,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:03:55,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:03:55,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:03:55,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:03:55,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:03:55" (1/1) ... [2022-10-16 13:03:55,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b3e49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:55, skipping insertion in model container [2022-10-16 13:03:55,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:03:55" (1/1) ... [2022-10-16 13:03:55,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:03:55,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:03:56,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-10-16 13:03:56,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:03:57,033 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:03:57,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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-10-16 13:03:57,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:03:57,614 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:03:57,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57 WrapperNode [2022-10-16 13:03:57,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:03:57,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:03:57,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:03:57,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:03:57,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,800 INFO L138 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1786 [2022-10-16 13:03:57,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:03:57,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:03:57,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:03:57,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:03:57,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,958 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:57,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:58,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:03:58,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:03:58,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:03:58,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:03:58,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (1/1) ... [2022-10-16 13:03:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:03:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:03:58,039 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-10-16 13:03:58,058 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-10-16 13:03:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-10-16 13:03:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-10-16 13:03:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 13:03:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-10-16 13:03:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-10-16 13:03:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-10-16 13:03:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-10-16 13:03:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-10-16 13:03:58,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-10-16 13:03:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 13:03:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 13:03:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 13:03:58,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 13:03:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:03:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-10-16 13:03:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-10-16 13:03:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-10-16 13:03:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-10-16 13:03:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-10-16 13:03:58,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-10-16 13:03:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-10-16 13:03:58,106 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-10-16 13:03:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-10-16 13:03:58,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-10-16 13:03:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-16 13:03:58,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-16 13:03:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-10-16 13:03:58,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-10-16 13:03:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:03:58,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:03:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-10-16 13:03:58,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-10-16 13:03:58,108 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-10-16 13:03:58,108 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-10-16 13:03:58,108 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 13:03:58,108 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 13:03:58,108 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-10-16 13:03:58,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-10-16 13:03:58,109 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-10-16 13:03:58,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-10-16 13:03:58,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:03:58,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 13:03:58,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 13:03:58,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 13:03:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 13:03:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 13:03:58,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 13:03:58,110 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-10-16 13:03:58,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-10-16 13:03:58,111 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-10-16 13:03:58,111 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-10-16 13:03:58,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:03:58,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-10-16 13:03:58,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-10-16 13:03:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:03:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-16 13:03:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-16 13:03:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-10-16 13:03:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-10-16 13:03:58,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 13:03:58,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:03:58,113 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-10-16 13:03:58,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-10-16 13:03:58,113 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-10-16 13:03:58,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-10-16 13:03:58,114 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-10-16 13:03:58,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-10-16 13:03:58,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:03:58,114 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-10-16 13:03:58,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-10-16 13:03:58,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:03:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:03:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-10-16 13:03:58,115 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-10-16 13:03:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-10-16 13:03:58,115 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-10-16 13:03:58,115 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-10-16 13:03:58,116 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-10-16 13:03:58,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-10-16 13:03:58,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-10-16 13:03:58,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 13:03:58,116 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-10-16 13:03:58,116 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-10-16 13:03:58,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 13:03:58,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-10-16 13:03:58,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-10-16 13:03:58,117 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-10-16 13:03:58,117 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-10-16 13:03:58,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:03:58,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:03:58,677 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:03:58,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:03:59,029 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 13:03:59,514 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-10-16 13:04:00,429 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:04:00,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:04:00,444 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 13:04:00,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:04:00 BoogieIcfgContainer [2022-10-16 13:04:00,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:04:00,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:04:00,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:04:00,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:04:00,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:03:55" (1/3) ... [2022-10-16 13:04:00,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be988e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:04:00, skipping insertion in model container [2022-10-16 13:04:00,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:57" (2/3) ... [2022-10-16 13:04:00,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be988e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:04:00, skipping insertion in model container [2022-10-16 13:04:00,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:04:00" (3/3) ... [2022-10-16 13:04:00,458 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-10-16 13:04:00,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:04:00,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-16 13:04:00,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:04:00,571 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=FINITE_AUTOMATA, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ae0f234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:04:00,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-16 13:04:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 561 states, 403 states have (on average 1.3325062034739454) internal successors, (537), 439 states have internal predecessors, (537), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-10-16 13:04:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 13:04:00,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:00,597 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, 1] [2022-10-16 13:04:00,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1073186812, now seen corresponding path program 1 times [2022-10-16 13:04:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:00,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251001609] [2022-10-16 13:04:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:04:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:01,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251001609] [2022-10-16 13:04:01,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251001609] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:01,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:01,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:04:01,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088386613] [2022-10-16 13:04:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 13:04:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 13:04:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 13:04:01,259 INFO L87 Difference]: Start difference. First operand has 561 states, 403 states have (on average 1.3325062034739454) internal successors, (537), 439 states have internal predecessors, (537), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:04:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:02,943 INFO L93 Difference]: Finished difference Result 1652 states and 2250 transitions. [2022-10-16 13:04:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:04:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-10-16 13:04:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:02,971 INFO L225 Difference]: With dead ends: 1652 [2022-10-16 13:04:02,971 INFO L226 Difference]: Without dead ends: 1039 [2022-10-16 13:04:02,983 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-10-16 13:04:02,987 INFO L413 NwaCegarLoop]: 926 mSDtfsCounter, 811 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:02,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1742 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-16 13:04:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2022-10-16 13:04:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 957. [2022-10-16 13:04:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 707 states have (on average 1.2927864214992928) internal successors, (914), 738 states have internal predecessors, (914), 160 states have call successors, (160), 67 states have call predecessors, (160), 72 states have return successors, (178), 156 states have call predecessors, (178), 160 states have call successors, (178) [2022-10-16 13:04:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1252 transitions. [2022-10-16 13:04:03,217 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1252 transitions. Word has length 36 [2022-10-16 13:04:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:03,218 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1252 transitions. [2022-10-16 13:04:03,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 13:04:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1252 transitions. [2022-10-16 13:04:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 13:04:03,224 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:03,225 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:03,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:04:03,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -620851510, now seen corresponding path program 1 times [2022-10-16 13:04:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:03,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526771468] [2022-10-16 13:04:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 13:04:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 13:04:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 13:04:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526771468] [2022-10-16 13:04:03,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526771468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:03,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:03,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:04:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195858165] [2022-10-16 13:04:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:04:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:04:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:04:03,503 INFO L87 Difference]: Start difference. First operand 957 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 13:04:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:06,141 INFO L93 Difference]: Finished difference Result 2927 states and 3920 transitions. [2022-10-16 13:04:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 13:04:06,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-10-16 13:04:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:06,195 INFO L225 Difference]: With dead ends: 2927 [2022-10-16 13:04:06,196 INFO L226 Difference]: Without dead ends: 1979 [2022-10-16 13:04:06,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:04:06,201 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 995 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:06,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 2559 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-16 13:04:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-10-16 13:04:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1620. [2022-10-16 13:04:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1196 states have (on average 1.2867892976588629) internal successors, (1539), 1238 states have internal predecessors, (1539), 262 states have call successors, (262), 122 states have call predecessors, (262), 144 states have return successors, (328), 268 states have call predecessors, (328), 262 states have call successors, (328) [2022-10-16 13:04:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2129 transitions. [2022-10-16 13:04:06,442 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2129 transitions. Word has length 42 [2022-10-16 13:04:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:06,442 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 2129 transitions. [2022-10-16 13:04:06,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 13:04:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2129 transitions. [2022-10-16 13:04:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 13:04:06,446 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:06,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:06,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:04:06,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1101278252, now seen corresponding path program 1 times [2022-10-16 13:04:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:06,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332509848] [2022-10-16 13:04:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 13:04:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 13:04:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 13:04:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:06,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332509848] [2022-10-16 13:04:06,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332509848] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:06,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:06,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:04:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093443383] [2022-10-16 13:04:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:04:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:04:06,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:04:06,765 INFO L87 Difference]: Start difference. First operand 1620 states and 2129 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 13:04:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:09,170 INFO L93 Difference]: Finished difference Result 4378 states and 5872 transitions. [2022-10-16 13:04:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 13:04:09,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2022-10-16 13:04:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:09,193 INFO L225 Difference]: With dead ends: 4378 [2022-10-16 13:04:09,193 INFO L226 Difference]: Without dead ends: 2774 [2022-10-16 13:04:09,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-10-16 13:04:09,202 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 1392 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:09,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 2083 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 13:04:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-10-16 13:04:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2263. [2022-10-16 13:04:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1675 states have (on average 1.2859701492537314) internal successors, (2154), 1728 states have internal predecessors, (2154), 361 states have call successors, (361), 176 states have call predecessors, (361), 209 states have return successors, (459), 371 states have call predecessors, (459), 361 states have call successors, (459) [2022-10-16 13:04:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2974 transitions. [2022-10-16 13:04:09,427 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2974 transitions. Word has length 61 [2022-10-16 13:04:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:09,427 INFO L495 AbstractCegarLoop]: Abstraction has 2263 states and 2974 transitions. [2022-10-16 13:04:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 13:04:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2974 transitions. [2022-10-16 13:04:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 13:04:09,430 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:09,430 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:09,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:04:09,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash 787025128, now seen corresponding path program 1 times [2022-10-16 13:04:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:09,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945587631] [2022-10-16 13:04:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 13:04:09,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:09,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945587631] [2022-10-16 13:04:09,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945587631] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:09,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:09,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:04:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247806076] [2022-10-16 13:04:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:09,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:04:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:09,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:04:09,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:04:09,751 INFO L87 Difference]: Start difference. First operand 2263 states and 2974 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:04:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:11,560 INFO L93 Difference]: Finished difference Result 3845 states and 5189 transitions. [2022-10-16 13:04:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:04:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-10-16 13:04:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:11,590 INFO L225 Difference]: With dead ends: 3845 [2022-10-16 13:04:11,591 INFO L226 Difference]: Without dead ends: 3839 [2022-10-16 13:04:11,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:04:11,600 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 1002 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:11,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1837 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-16 13:04:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2022-10-16 13:04:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3395. [2022-10-16 13:04:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3395 states, 2533 states have (on average 1.2755625740228977) internal successors, (3231), 2600 states have internal predecessors, (3231), 531 states have call successors, (531), 245 states have call predecessors, (531), 313 states have return successors, (717), 567 states have call predecessors, (717), 531 states have call successors, (717) [2022-10-16 13:04:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 4479 transitions. [2022-10-16 13:04:11,918 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 4479 transitions. Word has length 66 [2022-10-16 13:04:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:11,919 INFO L495 AbstractCegarLoop]: Abstraction has 3395 states and 4479 transitions. [2022-10-16 13:04:11,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 13:04:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 4479 transitions. [2022-10-16 13:04:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-16 13:04:11,925 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:11,926 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:04:11,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1180764131, now seen corresponding path program 1 times [2022-10-16 13:04:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:11,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123212147] [2022-10-16 13:04:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:04:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 13:04:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 13:04:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123212147] [2022-10-16 13:04:12,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123212147] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:12,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:12,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:04:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099410248] [2022-10-16 13:04:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:12,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:04:12,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:12,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:04:12,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:04:12,394 INFO L87 Difference]: Start difference. First operand 3395 states and 4479 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 13:04:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:16,123 INFO L93 Difference]: Finished difference Result 8826 states and 12019 transitions. [2022-10-16 13:04:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 13:04:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2022-10-16 13:04:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:16,174 INFO L225 Difference]: With dead ends: 8826 [2022-10-16 13:04:16,174 INFO L226 Difference]: Without dead ends: 6461 [2022-10-16 13:04:16,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-10-16 13:04:16,191 INFO L413 NwaCegarLoop]: 1228 mSDtfsCounter, 1476 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 862 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 862 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:16,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 4155 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [862 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-10-16 13:04:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2022-10-16 13:04:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 3403. [2022-10-16 13:04:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 2541 states have (on average 1.2746950019677292) internal successors, (3239), 2608 states have internal predecessors, (3239), 531 states have call successors, (531), 245 states have call predecessors, (531), 313 states have return successors, (717), 567 states have call predecessors, (717), 531 states have call successors, (717) [2022-10-16 13:04:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4487 transitions. [2022-10-16 13:04:16,712 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4487 transitions. Word has length 88 [2022-10-16 13:04:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:16,713 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 4487 transitions. [2022-10-16 13:04:16,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 13:04:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4487 transitions. [2022-10-16 13:04:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 13:04:16,715 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:16,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 13:04:16,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:04:16,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1540696662, now seen corresponding path program 1 times [2022-10-16 13:04:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:16,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676035260] [2022-10-16 13:04:16,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:16,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 13:04:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:04:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 13:04:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-10-16 13:04:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:17,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676035260] [2022-10-16 13:04:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676035260] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:17,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:17,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:04:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057421617] [2022-10-16 13:04:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:17,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:04:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:17,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:04:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:04:17,281 INFO L87 Difference]: Start difference. First operand 3403 states and 4487 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-10-16 13:04:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:19,773 INFO L93 Difference]: Finished difference Result 10339 states and 14495 transitions. [2022-10-16 13:04:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:04:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2022-10-16 13:04:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:19,823 INFO L225 Difference]: With dead ends: 10339 [2022-10-16 13:04:19,823 INFO L226 Difference]: Without dead ends: 6985 [2022-10-16 13:04:19,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:04:19,838 INFO L413 NwaCegarLoop]: 1222 mSDtfsCounter, 1607 mSDsluCounter, 3645 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:19,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 4867 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 13:04:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2022-10-16 13:04:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 3415. [2022-10-16 13:04:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 2553 states have (on average 1.2734038386212299) internal successors, (3251), 2620 states have internal predecessors, (3251), 531 states have call successors, (531), 245 states have call predecessors, (531), 313 states have return successors, (717), 567 states have call predecessors, (717), 531 states have call successors, (717) [2022-10-16 13:04:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4499 transitions. [2022-10-16 13:04:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4499 transitions. Word has length 92 [2022-10-16 13:04:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:20,295 INFO L495 AbstractCegarLoop]: Abstraction has 3415 states and 4499 transitions. [2022-10-16 13:04:20,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-10-16 13:04:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4499 transitions. [2022-10-16 13:04:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-10-16 13:04:20,297 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:20,297 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 13:04:20,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:04:20,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 574357859, now seen corresponding path program 1 times [2022-10-16 13:04:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:20,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179024741] [2022-10-16 13:04:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 13:04:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:04:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 13:04:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-10-16 13:04:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:20,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179024741] [2022-10-16 13:04:20,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179024741] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:20,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:20,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 13:04:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278137520] [2022-10-16 13:04:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:20,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:04:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:04:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:04:20,610 INFO L87 Difference]: Start difference. First operand 3415 states and 4499 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:04:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:21,982 INFO L93 Difference]: Finished difference Result 4923 states and 6863 transitions. [2022-10-16 13:04:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 13:04:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2022-10-16 13:04:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:22,038 INFO L225 Difference]: With dead ends: 4923 [2022-10-16 13:04:22,038 INFO L226 Difference]: Without dead ends: 4921 [2022-10-16 13:04:22,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:04:22,046 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 664 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:22,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1929 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 13:04:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2022-10-16 13:04:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 3511. [2022-10-16 13:04:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2641 states have (on average 1.2748958727754638) internal successors, (3367), 2708 states have internal predecessors, (3367), 539 states have call successors, (539), 245 states have call predecessors, (539), 313 states have return successors, (725), 575 states have call predecessors, (725), 539 states have call successors, (725) [2022-10-16 13:04:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4631 transitions. [2022-10-16 13:04:22,470 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4631 transitions. Word has length 94 [2022-10-16 13:04:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:22,471 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 4631 transitions. [2022-10-16 13:04:22,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:04:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4631 transitions. [2022-10-16 13:04:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 13:04:22,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:22,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:22,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 13:04:22,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1596831795, now seen corresponding path program 1 times [2022-10-16 13:04:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:22,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513591010] [2022-10-16 13:04:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 13:04:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 13:04:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 13:04:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-10-16 13:04:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513591010] [2022-10-16 13:04:23,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513591010] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:23,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117555013] [2022-10-16 13:04:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:04:23,314 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-10-16 13:04:23,332 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-10-16 13:04:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:23,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 13:04:23,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:04:24,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:24,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:04:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 13:04:24,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 13:04:24,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117555013] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:24,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 13:04:24,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2022-10-16 13:04:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551542233] [2022-10-16 13:04:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:24,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 13:04:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 13:04:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-10-16 13:04:24,229 INFO L87 Difference]: Start difference. First operand 3511 states and 4631 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:04:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:27,011 INFO L93 Difference]: Finished difference Result 7447 states and 9969 transitions. [2022-10-16 13:04:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 13:04:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2022-10-16 13:04:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:27,027 INFO L225 Difference]: With dead ends: 7447 [2022-10-16 13:04:27,028 INFO L226 Difference]: Without dead ends: 3985 [2022-10-16 13:04:27,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-10-16 13:04:27,041 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 369 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:27,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 4246 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-16 13:04:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2022-10-16 13:04:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3630. [2022-10-16 13:04:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 2743 states have (on average 1.2756106452788918) internal successors, (3499), 2811 states have internal predecessors, (3499), 547 states have call successors, (547), 251 states have call predecessors, (547), 322 states have return successors, (742), 585 states have call predecessors, (742), 547 states have call successors, (742) [2022-10-16 13:04:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 4788 transitions. [2022-10-16 13:04:27,451 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 4788 transitions. Word has length 95 [2022-10-16 13:04:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 3630 states and 4788 transitions. [2022-10-16 13:04:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 13:04:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 4788 transitions. [2022-10-16 13:04:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 13:04:27,456 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:27,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:27,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 13:04:27,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:27,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1516236504, now seen corresponding path program 1 times [2022-10-16 13:04:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:27,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176449196] [2022-10-16 13:04:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 13:04:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 13:04:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 13:04:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 13:04:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 13:04:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176449196] [2022-10-16 13:04:28,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176449196] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:28,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677316304] [2022-10-16 13:04:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:04:28,391 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-10-16 13:04:28,396 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-10-16 13:04:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:28,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 13:04:28,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:04:29,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:04:29,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:04:29,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:29,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:04:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 13:04:29,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:04:29,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_311) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-10-16 13:04:31,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| Int)) (or (not (<= |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.base|)) (forall ((|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| v_ArrVal_310) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| v_ArrVal_311) 26) 1)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11|)))))) is different from false [2022-10-16 13:04:31,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| v_ArrVal_310) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| v_ArrVal_311) 26) 1)) (< |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11|) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11|)))) is different from false [2022-10-16 13:04:31,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11| v_ArrVal_310) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| v_ArrVal_311) 26) 1)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base_4| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11|)) (< 0 |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_11|))) is different from false [2022-10-16 13:04:31,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677316304] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:31,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:04:31,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2022-10-16 13:04:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022983348] [2022-10-16 13:04:31,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:04:31,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 13:04:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 13:04:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=17, NotChecked=164, Total=600 [2022-10-16 13:04:31,443 INFO L87 Difference]: Start difference. First operand 3630 states and 4788 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 13 states have internal predecessors, (109), 3 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-16 13:04:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:34,299 INFO L93 Difference]: Finished difference Result 7751 states and 10414 transitions. [2022-10-16 13:04:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 13:04:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 13 states have internal predecessors, (109), 3 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) Word has length 97 [2022-10-16 13:04:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:34,320 INFO L225 Difference]: With dead ends: 7751 [2022-10-16 13:04:34,320 INFO L226 Difference]: Without dead ends: 4199 [2022-10-16 13:04:34,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=960, Unknown=21, NotChecked=268, Total=1406 [2022-10-16 13:04:34,336 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 828 mSDsluCounter, 4165 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:34,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 4921 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 13:04:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2022-10-16 13:04:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3636. [2022-10-16 13:04:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2747 states have (on average 1.2752093192573717) internal successors, (3503), 2817 states have internal predecessors, (3503), 547 states have call successors, (547), 251 states have call predecessors, (547), 324 states have return successors, (753), 585 states have call predecessors, (753), 547 states have call successors, (753) [2022-10-16 13:04:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 4803 transitions. [2022-10-16 13:04:34,721 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 4803 transitions. Word has length 97 [2022-10-16 13:04:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:34,722 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 4803 transitions. [2022-10-16 13:04:34,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 13 states have internal predecessors, (109), 3 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) [2022-10-16 13:04:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 4803 transitions. [2022-10-16 13:04:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 13:04:34,724 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:34,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:34,767 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-10-16 13:04:34,938 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,SelfDestructingSolverStorable8 [2022-10-16 13:04:34,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1374407187, now seen corresponding path program 1 times [2022-10-16 13:04:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:34,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211348947] [2022-10-16 13:04:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:04:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 13:04:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 13:04:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 13:04:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-10-16 13:04:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211348947] [2022-10-16 13:04:35,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211348947] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900302342] [2022-10-16 13:04:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:04:35,723 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-10-16 13:04:35,731 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-10-16 13:04:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:36,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 13:04:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:04:36,407 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-16 13:04:36,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-10-16 13:04:36,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-16 13:04:36,628 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-10-16 13:04:36,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-10-16 13:04:36,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 13:04:36,793 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 13:04:36,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-16 13:04:36,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:36,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:04:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-16 13:04:36,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:04:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900302342] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:37,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:04:37,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2022-10-16 13:04:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308069619] [2022-10-16 13:04:37,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:04:37,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 13:04:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:37,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 13:04:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-10-16 13:04:37,223 INFO L87 Difference]: Start difference. First operand 3636 states and 4803 transitions. Second operand has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2022-10-16 13:04:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:40,725 INFO L93 Difference]: Finished difference Result 8108 states and 10843 transitions. [2022-10-16 13:04:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 13:04:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) Word has length 107 [2022-10-16 13:04:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:40,745 INFO L225 Difference]: With dead ends: 8108 [2022-10-16 13:04:40,745 INFO L226 Difference]: Without dead ends: 4632 [2022-10-16 13:04:40,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=296, Invalid=2056, Unknown=0, NotChecked=0, Total=2352 [2022-10-16 13:04:40,759 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 869 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 6136 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:40,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 6136 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2475 Invalid, 0 Unknown, 82 Unchecked, 2.3s Time] [2022-10-16 13:04:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2022-10-16 13:04:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3902. [2022-10-16 13:04:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3902 states, 2980 states have (on average 1.275503355704698) internal successors, (3801), 3048 states have internal predecessors, (3801), 564 states have call successors, (564), 266 states have call predecessors, (564), 340 states have return successors, (776), 605 states have call predecessors, (776), 564 states have call successors, (776) [2022-10-16 13:04:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 5141 transitions. [2022-10-16 13:04:41,185 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 5141 transitions. Word has length 107 [2022-10-16 13:04:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:41,185 INFO L495 AbstractCegarLoop]: Abstraction has 3902 states and 5141 transitions. [2022-10-16 13:04:41,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 17 states have internal predecessors, (121), 6 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2022-10-16 13:04:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 5141 transitions. [2022-10-16 13:04:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-10-16 13:04:41,192 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:41,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:41,242 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-10-16 13:04:41,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:41,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1460952759, now seen corresponding path program 1 times [2022-10-16 13:04:41,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:41,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105148208] [2022-10-16 13:04:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:04:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 13:04:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 13:04:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 13:04:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-10-16 13:04:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105148208] [2022-10-16 13:04:42,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105148208] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:42,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5158763] [2022-10-16 13:04:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:42,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:42,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:04:42,203 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-10-16 13:04:42,222 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-10-16 13:04:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:42,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 1695 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-16 13:04:42,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:04:42,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:42,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:42,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:42,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:04:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 13:04:43,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:04:43,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_549) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-10-16 13:04:43,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_549) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-10-16 13:04:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 5 not checked. [2022-10-16 13:04:43,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5158763] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:04:43,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:04:43,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 30 [2022-10-16 13:04:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235638218] [2022-10-16 13:04:43,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:04:43,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 13:04:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 13:04:43,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=658, Unknown=2, NotChecked=106, Total=870 [2022-10-16 13:04:43,479 INFO L87 Difference]: Start difference. First operand 3902 states and 5141 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 25 states have internal predecessors, (169), 4 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (27), 7 states have call predecessors, (27), 4 states have call successors, (27) [2022-10-16 13:04:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:47,343 INFO L93 Difference]: Finished difference Result 8733 states and 11941 transitions. [2022-10-16 13:04:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 13:04:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 25 states have internal predecessors, (169), 4 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (27), 7 states have call predecessors, (27), 4 states have call successors, (27) Word has length 111 [2022-10-16 13:04:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:47,364 INFO L225 Difference]: With dead ends: 8733 [2022-10-16 13:04:47,365 INFO L226 Difference]: Without dead ends: 5249 [2022-10-16 13:04:47,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1156, Unknown=2, NotChecked=142, Total=1482 [2022-10-16 13:04:47,379 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 1117 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 10385 SdHoareTripleChecker+Invalid, 6911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2767 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:47,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 10385 Invalid, 6911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [401 Valid, 3743 Invalid, 0 Unknown, 2767 Unchecked, 3.1s Time] [2022-10-16 13:04:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5249 states. [2022-10-16 13:04:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5249 to 3915. [2022-10-16 13:04:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 2993 states have (on average 1.2736384898095556) internal successors, (3812), 3056 states have internal predecessors, (3812), 564 states have call successors, (564), 266 states have call predecessors, (564), 340 states have return successors, (776), 610 states have call predecessors, (776), 564 states have call successors, (776) [2022-10-16 13:04:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 5152 transitions. [2022-10-16 13:04:47,838 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 5152 transitions. Word has length 111 [2022-10-16 13:04:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:47,838 INFO L495 AbstractCegarLoop]: Abstraction has 3915 states and 5152 transitions. [2022-10-16 13:04:47,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 25 states have internal predecessors, (169), 4 states have call successors, (30), 7 states have call predecessors, (30), 8 states have return successors, (27), 7 states have call predecessors, (27), 4 states have call successors, (27) [2022-10-16 13:04:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 5152 transitions. [2022-10-16 13:04:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-16 13:04:47,844 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:47,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:47,889 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-10-16 13:04:48,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:48,061 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -119086801, now seen corresponding path program 2 times [2022-10-16 13:04:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:48,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857872490] [2022-10-16 13:04:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:04:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 13:04:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 13:04:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-10-16 13:04:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 13:04:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857872490] [2022-10-16 13:04:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857872490] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:04:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:04:49,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 13:04:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000395494] [2022-10-16 13:04:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:04:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 13:04:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 13:04:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-16 13:04:49,444 INFO L87 Difference]: Start difference. First operand 3915 states and 5152 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:04:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:04:51,537 INFO L93 Difference]: Finished difference Result 8183 states and 10927 transitions. [2022-10-16 13:04:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 13:04:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 115 [2022-10-16 13:04:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:04:51,555 INFO L225 Difference]: With dead ends: 8183 [2022-10-16 13:04:51,555 INFO L226 Difference]: Without dead ends: 4691 [2022-10-16 13:04:51,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 13:04:51,569 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 474 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 4338 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:04:51,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 4338 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 13:04:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-10-16 13:04:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 3931. [2022-10-16 13:04:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3009 states have (on average 1.272183449651047) internal successors, (3828), 3068 states have internal predecessors, (3828), 564 states have call successors, (564), 266 states have call predecessors, (564), 340 states have return successors, (776), 614 states have call predecessors, (776), 564 states have call successors, (776) [2022-10-16 13:04:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5168 transitions. [2022-10-16 13:04:51,988 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5168 transitions. Word has length 115 [2022-10-16 13:04:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:04:51,989 INFO L495 AbstractCegarLoop]: Abstraction has 3931 states and 5168 transitions. [2022-10-16 13:04:51,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-10-16 13:04:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5168 transitions. [2022-10-16 13:04:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-10-16 13:04:51,995 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:04:51,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:04:51,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 13:04:51,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:04:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:04:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash -377951284, now seen corresponding path program 1 times [2022-10-16 13:04:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:04:51,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490049187] [2022-10-16 13:04:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:04:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:54,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:04:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:04:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:04:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:04:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:04:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 13:04:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 13:04:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-10-16 13:04:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:04:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:04:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:04:55,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490049187] [2022-10-16 13:04:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490049187] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924716384] [2022-10-16 13:04:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:04:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:04:55,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:04:55,289 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-10-16 13:04:55,313 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-10-16 13:04:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:04:55,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 58 conjunts are in the unsatisfiable core [2022-10-16 13:04:55,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:04:55,977 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-16 13:04:55,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-10-16 13:04:56,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-16 13:04:56,194 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-10-16 13:04:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-10-16 13:04:56,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 13:04:56,359 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 13:04:56,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-16 13:04:56,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:56,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 13:04:56,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:04:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-16 13:04:56,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:04:56,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_745 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_745) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-10-16 13:04:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924716384] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:04:56,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:04:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2022-10-16 13:04:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237088872] [2022-10-16 13:04:56,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:04:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 13:04:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:04:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 13:04:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1414, Unknown=3, NotChecked=76, Total=1640 [2022-10-16 13:04:56,995 INFO L87 Difference]: Start difference. First operand 3931 states and 5168 transitions. Second operand has 33 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 29 states have internal predecessors, (127), 11 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) [2022-10-16 13:05:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:05:03,114 INFO L93 Difference]: Finished difference Result 8431 states and 11247 transitions. [2022-10-16 13:05:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-16 13:05:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 29 states have internal predecessors, (127), 11 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) Word has length 121 [2022-10-16 13:05:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:05:03,132 INFO L225 Difference]: With dead ends: 8431 [2022-10-16 13:05:03,132 INFO L226 Difference]: Without dead ends: 4532 [2022-10-16 13:05:03,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=448, Invalid=3585, Unknown=3, NotChecked=124, Total=4160 [2022-10-16 13:05:03,147 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 866 mSDsluCounter, 7404 mSDsCounter, 0 mSdLazyCounter, 4835 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 8100 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 4835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:05:03,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 8100 Invalid, 5616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 4835 Invalid, 0 Unknown, 486 Unchecked, 4.4s Time] [2022-10-16 13:05:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2022-10-16 13:05:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 3777. [2022-10-16 13:05:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3777 states, 2913 states have (on average 1.279093717816684) internal successors, (3726), 2970 states have internal predecessors, (3726), 546 states have call successors, (546), 268 states have call predecessors, (546), 300 states have return successors, (658), 556 states have call predecessors, (658), 546 states have call successors, (658) [2022-10-16 13:05:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 4930 transitions. [2022-10-16 13:05:03,594 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 4930 transitions. Word has length 121 [2022-10-16 13:05:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:05:03,594 INFO L495 AbstractCegarLoop]: Abstraction has 3777 states and 4930 transitions. [2022-10-16 13:05:03,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 29 states have internal predecessors, (127), 11 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 13 states have call predecessors, (24), 11 states have call successors, (24) [2022-10-16 13:05:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 4930 transitions. [2022-10-16 13:05:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-16 13:05:03,598 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:05:03,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:05:03,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-16 13:05:03,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 13:05:03,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:05:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:05:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash 923072305, now seen corresponding path program 2 times [2022-10-16 13:05:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:05:03,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675496757] [2022-10-16 13:05:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:05:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:05:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:05:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:05:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:05:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:05:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:05:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 13:05:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 13:05:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 13:05:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:05:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:05:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675496757] [2022-10-16 13:05:07,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675496757] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:05:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212847302] [2022-10-16 13:05:07,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 13:05:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:05:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:05:07,574 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-10-16 13:05:07,595 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-10-16 13:05:08,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 13:05:08,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 13:05:08,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 60 conjunts are in the unsatisfiable core [2022-10-16 13:05:08,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:05:08,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-10-16 13:05:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:08,451 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 21 treesize of output 20 [2022-10-16 13:05:08,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:08,532 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 21 treesize of output 20 [2022-10-16 13:05:08,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:05:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-16 13:05:08,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:05:11,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_890 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| Int) (v_ArrVal_889 Int) (v_ArrVal_887 Int) (v_ArrVal_886 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| 248) v_ArrVal_886) (+ 598 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_887) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| v_ArrVal_889) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| 1) v_ArrVal_890)) 26) 2)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|)))) is different from false [2022-10-16 13:05:12,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_890 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| Int) (v_ArrVal_889 Int) (v_ArrVal_887 Int) (v_ArrVal_886 Int)) (or (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset|)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 248) v_ArrVal_886) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 598) v_ArrVal_887) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| v_ArrVal_889) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| 1) v_ArrVal_890)) 26) 2)))) is different from false [2022-10-16 13:05:14,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_890 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| Int) (v_ArrVal_889 Int) (v_ArrVal_887 Int) (v_ArrVal_886 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 248) v_ArrVal_886) (+ 598 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) v_ArrVal_887) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| v_ArrVal_889) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| 1) v_ArrVal_890)) 26) 2)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|)))) is different from false [2022-10-16 13:05:16,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_890 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| Int) (v_ArrVal_889 Int) (v_ArrVal_887 Int) (v_ArrVal_886 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 248 v_ArrVal_886) 598 v_ArrVal_887) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| v_ArrVal_889) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| 1) v_ArrVal_890)) 26) 2)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_8| 0)))) is different from false [2022-10-16 13:05:16,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212847302] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:05:16,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:05:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 32 [2022-10-16 13:05:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464769156] [2022-10-16 13:05:16,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:05:16,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 13:05:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:05:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 13:05:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1287, Unknown=4, NotChecked=300, Total=1722 [2022-10-16 13:05:16,598 INFO L87 Difference]: Start difference. First operand 3777 states and 4930 transitions. Second operand has 32 states, 32 states have (on average 4.15625) internal successors, (133), 28 states have internal predecessors, (133), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:05:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:05:24,422 INFO L93 Difference]: Finished difference Result 7854 states and 10385 transitions. [2022-10-16 13:05:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-10-16 13:05:24,424 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 28 states have internal predecessors, (133), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) Word has length 123 [2022-10-16 13:05:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:05:24,442 INFO L225 Difference]: With dead ends: 7854 [2022-10-16 13:05:24,442 INFO L226 Difference]: Without dead ends: 4570 [2022-10-16 13:05:24,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=740, Invalid=5592, Unknown=4, NotChecked=636, Total=6972 [2022-10-16 13:05:24,456 INFO L413 NwaCegarLoop]: 714 mSDtfsCounter, 1549 mSDsluCounter, 6747 mSDsCounter, 0 mSdLazyCounter, 5277 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 7461 SdHoareTripleChecker+Invalid, 5947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 5277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-10-16 13:05:24,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 7461 Invalid, 5947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 5277 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-10-16 13:05:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-10-16 13:05:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3879. [2022-10-16 13:05:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 2998 states have (on average 1.2775183455637091) internal successors, (3830), 3056 states have internal predecessors, (3830), 554 states have call successors, (554), 276 states have call predecessors, (554), 309 states have return successors, (668), 564 states have call predecessors, (668), 554 states have call successors, (668) [2022-10-16 13:05:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5052 transitions. [2022-10-16 13:05:24,991 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5052 transitions. Word has length 123 [2022-10-16 13:05:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:05:24,991 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 5052 transitions. [2022-10-16 13:05:24,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 28 states have internal predecessors, (133), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:05:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5052 transitions. [2022-10-16 13:05:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-10-16 13:05:24,996 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:05:24,996 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 13:05:25,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-16 13:05:25,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:05:25,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:05:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:05:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1371258198, now seen corresponding path program 3 times [2022-10-16 13:05:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:05:25,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733202973] [2022-10-16 13:05:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:05:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:05:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:05:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:05:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:05:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:05:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:05:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 13:05:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 13:05:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 13:05:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:05:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:05:29,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733202973] [2022-10-16 13:05:29,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733202973] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:05:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672743101] [2022-10-16 13:05:29,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 13:05:29,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:05:29,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:05:29,188 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-10-16 13:05:29,204 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-10-16 13:05:33,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 13:05:33,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 13:05:33,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-16 13:05:33,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:05:33,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-10-16 13:05:33,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:33,581 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 21 treesize of output 20 [2022-10-16 13:05:33,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:33,643 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 21 treesize of output 20 [2022-10-16 13:05:33,713 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 19 treesize of output 18 [2022-10-16 13:05:33,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:05:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-16 13:05:33,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:05:36,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1051 Int) (v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1048 Int) (v_ArrVal_1047 Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| 248) v_ArrVal_1042) (+ 598 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1044) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_1047) (+ |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| 1) v_ArrVal_1048) (+ 2 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1051)) 26) 3) 0))) is different from false [2022-10-16 13:05:37,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1051 Int) (v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1048 Int) (v_ArrVal_1047 Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 248) v_ArrVal_1042) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 598) v_ArrVal_1044) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_1047) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 1) v_ArrVal_1048) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 2) v_ArrVal_1051)) 26) 3) 0))) is different from false [2022-10-16 13:05:39,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1051 Int) (v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1048 Int) (v_ArrVal_1047 Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 248) v_ArrVal_1042) (+ 598 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) v_ArrVal_1044) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_1047) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 1) v_ArrVal_1048) (+ 2 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) v_ArrVal_1051)) 26) 3) 0))) is different from false [2022-10-16 13:05:40,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1051 Int) (v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1048 Int) (v_ArrVal_1047 Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 248 v_ArrVal_1042) 598 v_ArrVal_1044) 0 v_ArrVal_1047) 1 v_ArrVal_1048) 2 v_ArrVal_1051)) 26) 3) 0))) is different from false [2022-10-16 13:05:40,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672743101] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:05:40,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:05:40,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 33 [2022-10-16 13:05:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120153104] [2022-10-16 13:05:40,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:05:40,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 13:05:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:05:40,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 13:05:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1511, Unknown=4, NotChecked=324, Total=1980 [2022-10-16 13:05:40,525 INFO L87 Difference]: Start difference. First operand 3879 states and 5052 transitions. Second operand has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:05:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:05:50,893 INFO L93 Difference]: Finished difference Result 7946 states and 10513 transitions. [2022-10-16 13:05:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-10-16 13:05:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) Word has length 125 [2022-10-16 13:05:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:05:50,917 INFO L225 Difference]: With dead ends: 7946 [2022-10-16 13:05:50,917 INFO L226 Difference]: Without dead ends: 4662 [2022-10-16 13:05:50,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=908, Invalid=7476, Unknown=4, NotChecked=732, Total=9120 [2022-10-16 13:05:50,933 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 1496 mSDsluCounter, 10042 mSDsCounter, 0 mSdLazyCounter, 7950 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 10817 SdHoareTripleChecker+Invalid, 8734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 7950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:05:50,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 10817 Invalid, 8734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [784 Valid, 7950 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-10-16 13:05:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2022-10-16 13:05:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 3881. [2022-10-16 13:05:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 3000 states have (on average 1.2773333333333334) internal successors, (3832), 3058 states have internal predecessors, (3832), 554 states have call successors, (554), 276 states have call predecessors, (554), 309 states have return successors, (668), 564 states have call predecessors, (668), 554 states have call successors, (668) [2022-10-16 13:05:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5054 transitions. [2022-10-16 13:05:51,484 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5054 transitions. Word has length 125 [2022-10-16 13:05:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:05:51,485 INFO L495 AbstractCegarLoop]: Abstraction has 3881 states and 5054 transitions. [2022-10-16 13:05:51,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 29 states have internal predecessors, (136), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:05:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5054 transitions. [2022-10-16 13:05:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-16 13:05:51,489 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:05:51,489 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:05:51,540 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-10-16 13:05:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:05:51,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:05:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:05:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1713795525, now seen corresponding path program 4 times [2022-10-16 13:05:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:05:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131988729] [2022-10-16 13:05:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:05:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:05:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 13:05:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:05:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-16 13:05:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 13:05:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 13:05:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 13:05:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 13:05:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-16 13:05:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:05:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:05:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-16 13:05:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:05:55,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131988729] [2022-10-16 13:05:55,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131988729] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:05:55,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394295772] [2022-10-16 13:05:55,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 13:05:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:05:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:05:55,530 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-10-16 13:05:55,542 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-10-16 13:05:56,521 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 13:05:56,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 13:05:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 13:05:56,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:05:56,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-10-16 13:05:56,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:56,936 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 21 treesize of output 20 [2022-10-16 13:05:57,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:57,011 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 21 treesize of output 20 [2022-10-16 13:05:57,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:57,105 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 21 treesize of output 20 [2022-10-16 13:05:57,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:05:57,180 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 21 treesize of output 20 [2022-10-16 13:05:57,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:05:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-16 13:05:57,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:06:00,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 Int) (v_ArrVal_1215 Int) (v_ArrVal_1214 Int) (v_ArrVal_1225 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| Int) (v_ArrVal_1218 Int)) (or (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| 248) v_ArrVal_1215) (+ 598 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1214) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| v_ArrVal_1218) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| 1) v_ArrVal_1221) (+ 2 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1222) (+ 3 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1225)) 26) 4)))) is different from false [2022-10-16 13:06:02,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 Int) (v_ArrVal_1215 Int) (v_ArrVal_1214 Int) (v_ArrVal_1225 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| Int) (v_ArrVal_1218 Int)) (or (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset|)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 248) v_ArrVal_1215) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 598) v_ArrVal_1214) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| v_ArrVal_1218) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| 1) v_ArrVal_1221) (+ 2 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1222) (+ 3 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1225)) 26) 4)))) is different from false [2022-10-16 13:06:04,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 Int) (v_ArrVal_1215 Int) (v_ArrVal_1214 Int) (v_ArrVal_1225 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| Int) (v_ArrVal_1218 Int)) (or (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 248) v_ArrVal_1215) (+ 598 |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|) v_ArrVal_1214) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| v_ArrVal_1218) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| 1) v_ArrVal_1221) (+ 2 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1222) (+ 3 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1225)) 26) 4)) (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset|)))) is different from false [2022-10-16 13:06:06,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1222 Int) (v_ArrVal_1221 Int) (v_ArrVal_1215 Int) (v_ArrVal_1214 Int) (v_ArrVal_1225 Int) (|v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| Int) (v_ArrVal_1218 Int)) (or (not (<= |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| 0)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 248 v_ArrVal_1215) 598 v_ArrVal_1214) |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| v_ArrVal_1218) (+ |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10| 1) v_ArrVal_1221) (+ 2 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1222) (+ 3 |v_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.offset_10|) v_ArrVal_1225)) 26) 4)))) is different from false [2022-10-16 13:06:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394295772] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:06:06,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:06:06,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 36 [2022-10-16 13:06:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368376993] [2022-10-16 13:06:06,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:06:06,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 13:06:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:06:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 13:06:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1923, Unknown=4, NotChecked=364, Total=2450 [2022-10-16 13:06:06,222 INFO L87 Difference]: Start difference. First operand 3881 states and 5054 transitions. Second operand has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 32 states have internal predecessors, (141), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:06:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:06:19,657 INFO L93 Difference]: Finished difference Result 7866 states and 10397 transitions. [2022-10-16 13:06:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-10-16 13:06:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 32 states have internal predecessors, (141), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) Word has length 127 [2022-10-16 13:06:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:06:19,672 INFO L225 Difference]: With dead ends: 7866 [2022-10-16 13:06:19,672 INFO L226 Difference]: Without dead ends: 4582 [2022-10-16 13:06:19,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=874, Invalid=7880, Unknown=4, NotChecked=748, Total=9506 [2022-10-16 13:06:19,684 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 1383 mSDsluCounter, 11826 mSDsCounter, 0 mSdLazyCounter, 10498 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 12536 SdHoareTripleChecker+Invalid, 11153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 10498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-10-16 13:06:19,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 12536 Invalid, 11153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [655 Valid, 10498 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-10-16 13:06:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2022-10-16 13:06:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 3883. [2022-10-16 13:06:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3002 states have (on average 1.2771485676215857) internal successors, (3834), 3060 states have internal predecessors, (3834), 554 states have call successors, (554), 276 states have call predecessors, (554), 309 states have return successors, (668), 564 states have call predecessors, (668), 554 states have call successors, (668) [2022-10-16 13:06:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5056 transitions. [2022-10-16 13:06:20,050 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5056 transitions. Word has length 127 [2022-10-16 13:06:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:06:20,051 INFO L495 AbstractCegarLoop]: Abstraction has 3883 states and 5056 transitions. [2022-10-16 13:06:20,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 32 states have internal predecessors, (141), 9 states have call successors, (25), 6 states have call predecessors, (25), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2022-10-16 13:06:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5056 transitions. [2022-10-16 13:06:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-10-16 13:06:20,056 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:06:20,056 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:06:20,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-16 13:06:20,269 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,SelfDestructingSolverStorable15 [2022-10-16 13:06:20,270 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2022-10-16 13:06:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:06:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1371978208, now seen corresponding path program 5 times [2022-10-16 13:06:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:06:20,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992698718] [2022-10-16 13:06:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:06:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:06:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:06:20,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 13:06:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 13:06:20,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 13:06:20,772 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 13:06:20,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-10-16 13:06:20,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_usb_fill_bulk_urb_8Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-10-16 13:06:20,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_usb_fill_bulk_urb_8Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-10-16 13:06:20,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __create_pipeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-10-16 13:06:20,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-10-16 13:06:20,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-10-16 13:06:20,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-10-16 13:06:20,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-10-16 13:06:20,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-10-16 13:06:20,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-10-16 13:06:20,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-10-16 13:06:20,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-10-16 13:06:20,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-10-16 13:06:20,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-10-16 13:06:20,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-10-16 13:06:20,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-10-16 13:06:20,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-10-16 13:06:20,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-10-16 13:06:20,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 13:06:20,788 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:06:20,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:06:20,877 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,879 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,879 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,880 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,881 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,882 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,882 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,882 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,883 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,883 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,883 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,884 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,884 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,884 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,884 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,886 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,886 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,886 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,886 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,887 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,887 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,887 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,889 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,891 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,891 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,901 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,902 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,903 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,904 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,905 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,906 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,907 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,908 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,909 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,910 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,911 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,911 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,911 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,912 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,913 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,920 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,924 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,925 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,925 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,925 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,926 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,927 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,928 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,929 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-10-16 13:06:20,930 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-10-16 13:06:20,930 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:20,931 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-10-16 13:06:21,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:06:21 BoogieIcfgContainer [2022-10-16 13:06:21,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:06:21,169 INFO L158 Benchmark]: Toolchain (without parser) took 145766.68ms. Allocated memory was 160.4MB in the beginning and 955.3MB in the end (delta: 794.8MB). Free memory was 126.0MB in the beginning and 849.0MB in the end (delta: -723.0MB). Peak memory consumption was 610.2MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,169 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 160.4MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:06:21,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2207.50ms. Allocated memory was 160.4MB in the beginning and 204.5MB in the end (delta: 44.0MB). Free memory was 125.8MB in the beginning and 161.9MB in the end (delta: -36.2MB). Peak memory consumption was 108.2MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 183.94ms. Allocated memory is still 204.5MB. Free memory was 161.9MB in the beginning and 149.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,173 INFO L158 Benchmark]: Boogie Preprocessor took 200.22ms. Allocated memory is still 204.5MB. Free memory was 149.9MB in the beginning and 137.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,173 INFO L158 Benchmark]: RCFGBuilder took 2445.49ms. Allocated memory was 204.5MB in the beginning and 359.7MB in the end (delta: 155.2MB). Free memory was 137.9MB in the beginning and 301.3MB in the end (delta: -163.4MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,173 INFO L158 Benchmark]: TraceAbstraction took 140718.29ms. Allocated memory was 359.7MB in the beginning and 955.3MB in the end (delta: 595.6MB). Free memory was 300.8MB in the beginning and 849.0MB in the end (delta: -548.3MB). Peak memory consumption was 584.2MB. Max. memory is 8.0GB. [2022-10-16 13:06:21,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 160.4MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2207.50ms. Allocated memory was 160.4MB in the beginning and 204.5MB in the end (delta: 44.0MB). Free memory was 125.8MB in the beginning and 161.9MB in the end (delta: -36.2MB). Peak memory consumption was 108.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 183.94ms. Allocated memory is still 204.5MB. Free memory was 161.9MB in the beginning and 149.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 200.22ms. Allocated memory is still 204.5MB. Free memory was 149.9MB in the beginning and 137.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2445.49ms. Allocated memory was 204.5MB in the beginning and 359.7MB in the end (delta: 155.2MB). Free memory was 137.9MB in the beginning and 301.3MB in the end (delta: -163.4MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. * TraceAbstraction took 140718.29ms. Allocated memory was 359.7MB in the beginning and 955.3MB in the end (delta: 595.6MB). Free memory was 300.8MB in the beginning and 849.0MB in the end (delta: -548.3MB). Peak memory consumption was 584.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 5406]: integer overflow possible integer overflow possible We found a FailurePath: [L5516] int ldv_state_variable_3 ; [L5517] int LDV_IN_INTERRUPT = 1; [L5518] int ldv_state_variable_2 ; [L5519] struct net_device *ipheth_netdev_ops_group1 ; [L5520] int ref_cnt ; [L5521] int ldv_state_variable_1 ; [L5522] int usb_counter ; [L5523] struct usb_interface *ipheth_driver_group1 ; [L5524] int ldv_state_variable_0 ; [L5656-L5674] static struct usb_device_id ipheth_table[10U] = { {899U, 1452U, 4752U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4754U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4756U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4759U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4762U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4779U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4764U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4768U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}, {899U, 1452U, 4776U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 253U, 1U, (unsigned char)0, 0UL}}; [L5675] struct usb_device_id const __mod_usb_device_table ; [L6036-L6040] static struct net_device_ops const ipheth_netdev_ops = {0, 0, & ipheth_open, & ipheth_close, (netdev_tx_t (*)(struct sk_buff * , struct net_device * ))(& ipheth_tx), 0, 0, 0, 0, 0, 0, 0, 0, 0, & ipheth_tx_timeout, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6181-L6186] static struct usb_driver ipheth_driver = {"ipheth", & ipheth_probe, & ipheth_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& ipheth_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, 1U, (unsigned char)0}; [L6202] int ldv_retval_2 ; [L6203] int ldv_retval_0 ; [L6207] int ldv_retval_1 ; [L6209] int ldv_retval_3 ; [L6582] int INTERF_STATE = 0; [L6583] int SERIAL_STATE = 0; [L6584] void *usb_intfdata = 0; [L6585] struct urb *usb_urb = 0; [L6586] struct usb_device *usb_dev = 0; [L6587] int dev_counter = 0; [L6588] int completeFnIntCounter = 0; [L6589] int completeFnBulkCounter = 0; [L6590] void (*completeFnInt)(struct urb * ) ; [L6591] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6230] struct usb_device_id *ldvarg0 ; [L6231] void *tmp ; [L6232] struct net_device *ldvarg1 ; [L6233] void *tmp___0 ; [L6234] struct sk_buff *ldvarg2 ; [L6235] void *tmp___1 ; [L6236] int tmp___2 ; [L6237] int tmp___3 ; [L6238] int tmp___4 ; [L6239] int tmp___5 ; [L6240] int tmp___6 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6242] CALL, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5458] void *p ; [L5459] void *tmp ; [L5460] int tmp___0 ; [L5462] tmp___0 = __VERIFIER_nondet_int() [L5463] COND TRUE tmp___0 != 0 [L5464] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6242] RET, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(32UL)={0:0}, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6242] tmp = ldv_zalloc(32UL) [L6243] ldvarg0 = (struct usb_device_id *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6244] CALL, EXPR ldv_zalloc(3136UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5458] void *p ; [L5459] void *tmp ; [L5460] int tmp___0 ; [L5462] tmp___0 = __VERIFIER_nondet_int() [L5463] COND TRUE tmp___0 != 0 [L5464] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=3136, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=3136, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6244] RET, EXPR ldv_zalloc(3136UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(3136UL)={0:0}, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6244] tmp___0 = ldv_zalloc(3136UL) [L6245] ldvarg1 = (struct net_device *)tmp___0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6246] CALL, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5458] void *p ; [L5459] void *tmp ; [L5460] int tmp___0 ; [L5462] tmp___0 = __VERIFIER_nondet_int() [L5463] COND TRUE tmp___0 != 0 [L5464] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=240, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=240, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6246] RET, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(240UL)={0:0}, ldvarg0={0:0}, ldvarg1={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6246] tmp___1 = ldv_zalloc(240UL) [L6247] ldvarg2 = (struct sk_buff *)tmp___1 [L6248] FCALL ldv_initialize() [L6249] ldv_state_variable_1 = 0 [L6250] ref_cnt = 0 [L6251] ldv_state_variable_0 = 1 [L6252] ldv_state_variable_3 = 0 [L6253] ldv_state_variable_2 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6255] tmp___2 = __VERIFIER_nondet_int() [L6257] case 0: [L6287] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6288] COND TRUE ldv_state_variable_0 != 0 [L6289] tmp___4 = __VERIFIER_nondet_int() [L6291] case 0: [L6299] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, tmp___4=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6300] COND TRUE ldv_state_variable_0 == 1 [L6301] CALL, EXPR ipheth_driver_init() [L6189] int tmp ; [L6191] CALL, EXPR ldv_usb_register_driver_19(& ipheth_driver, & __this_module, "ipheth") [L6554] ldv_func_ret_type___0 ldv_func_res ; [L6555] int tmp ; [L6557] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6941] return __VERIFIER_nondet_int(); [L6557] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6557] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6558] ldv_func_res = tmp [L6559] ldv_state_variable_1 = 1 [L6560] usb_counter = 0 [L6561] CALL ldv_usb_driver_1() [L6212] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6214] CALL, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5458] void *p ; [L5459] void *tmp ; [L5460] int tmp___0 ; [L5462] tmp___0 = __VERIFIER_nondet_int() [L5463] COND TRUE tmp___0 != 0 [L5464] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=1520, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6214] RET, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_zalloc(1520UL)={0:0}, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6214] tmp = ldv_zalloc(1520UL) [L6215] ipheth_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6561] RET ldv_usb_driver_1() [L6562] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, ldv_func_arg1={39:0}, ldv_func_arg1={39:0}, ldv_func_arg2={8388623:8388629}, ldv_func_arg2={8388623:8388629}, ldv_func_arg3={36:0}, ldv_func_arg3={36:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6191] RET, EXPR ldv_usb_register_driver_19(& ipheth_driver, & __this_module, "ipheth") [L6191] tmp = ldv_usb_register_driver_19(& ipheth_driver, & __this_module, "ipheth") [L6192] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6301] RET, EXPR ipheth_driver_init() [L6301] ldv_retval_1 = ipheth_driver_init() [L6302] COND TRUE ldv_retval_1 == 0 [L6303] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, tmp___4=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6306] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=1, tmp___4=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6255] tmp___2 = __VERIFIER_nondet_int() [L6257] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=0, tmp___4=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6258] COND TRUE ldv_state_variable_1 != 0 [L6259] tmp___3 = __VERIFIER_nondet_int() [L6261] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0={0:0}, ldvarg1={0:0}, ldvarg2={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, tmp___1={0:0}, tmp___2=0, tmp___3=0, tmp___4=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6262] COND TRUE ldv_state_variable_1 == 1 [L6263] CALL ipheth_probe(ipheth_driver_group1, (struct usb_device_id const *)ldvarg0) [L6043] struct usb_device *udev ; [L6044] struct usb_device *tmp ; [L6045] struct usb_host_interface *hintf ; [L6046] struct usb_endpoint_descriptor *endp ; [L6047] struct ipheth_device *dev ; [L6048] struct net_device *netdev ; [L6049] int i ; [L6050] int retval ; [L6051] void *tmp___0 ; [L6052] int tmp___1 ; [L6053] int tmp___2 ; [L6054] void *tmp___3 ; [L6055] struct lock_class_key __key ; [L6056] atomic_long_t __constr_expr_0 ; [L6057] struct lock_class_key __key___0 ; [L6059] CALL, EXPR interface_to_usbdev(intf) [L6424] struct usb_device *tmp ; [L6426] CALL, EXPR ldv_interface_to_usbdev() [L6695] void *result ; [L6696] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6698] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1181, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5441] void *p ; [L5442] void *tmp ; [L5443] int tmp___0 ; [L5445] tmp___0 = __VERIFIER_nondet_int() [L5446] COND FALSE !(tmp___0 != 0) [L5449] tmp = malloc(size) [L5450] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1181, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=1181, tmp={-4294967297:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5437] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1181, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=1181, tmp={-4294967297:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5452] return (p); VAL [={0:0}, ={0:0}, \old(size)=1181, \result={-4294967297:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=1181, tmp={-4294967297:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6698] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-4294967297:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6698] tmp = ldv_malloc(sizeof(struct usb_device)) [L6699] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, result={-4294967297:0}, SERIAL_STATE=0, tmp={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6700] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, result={-4294967297:0}, SERIAL_STATE=0, tmp={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6704] return (result); VAL [={0:0}, ={0:0}, \result={-4294967297:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, result={-4294967297:0}, SERIAL_STATE=0, tmp={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6426] RET, EXPR ldv_interface_to_usbdev() [L6426] tmp = ldv_interface_to_usbdev() [L6427] return (tmp); VAL [={0:0}, ={0:0}, \result={-4294967297:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6059] RET, EXPR interface_to_usbdev(intf) [L6059] tmp = interface_to_usbdev(intf) [L6060] udev = tmp [L6061] CALL, EXPR alloc_etherdev_mqs(304, 1U, 1U) [L6845] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [={0:0}, ={0:0}, \old(size)=1815, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5441] void *p ; [L5442] void *tmp ; [L5443] int tmp___0 ; [L5445] tmp___0 = __VERIFIER_nondet_int() [L5446] COND FALSE !(tmp___0 != 0) [L5449] tmp = malloc(size) [L5450] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1815, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1815, tmp={-8589934593:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5437] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1815, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1815, tmp={-8589934593:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5452] return (p); VAL [={0:0}, ={0:0}, \old(size)=1815, \result={-8589934593:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1815, tmp={-8589934593:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6845] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [={0:0}, ={0:0}, \old(arg0)=304, \old(arg1)=1, \old(arg2)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, arg0=304, arg1=1, arg2=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={-8589934593:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6845] return ldv_malloc(sizeof(struct net_device)); [L6061] RET, EXPR alloc_etherdev_mqs(304, 1U, 1U) [L6061] netdev = alloc_etherdev_mqs(304, 1U, 1U) [L6062] COND FALSE !((unsigned long )netdev == (unsigned long )((struct net_device *)0)) [L6066] netdev->netdev_ops = & ipheth_netdev_ops [L6067] netdev->watchdog_timeo = 1250 [L6068] FCALL strcpy((char *)(& netdev->name), "eth%d") [L6069] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:0}, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5555] return ((void *)dev + 3136U); VAL [={0:0}, ={0:0}, \result={-8589934593:3136}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:0}, dev={-8589934593:0}, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6069] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [={0:0}, ={0:0}, __constr_expr_0={41:0}, __key={47:0}, __key___0={49:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, id={0:0}, id={0:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, netdev={-8589934593:0}, netdev_priv((struct net_device const *)netdev)={-8589934593:3136}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, udev={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6069] tmp___0 = netdev_priv((struct net_device const *)netdev) [L6070] dev = (struct ipheth_device *)tmp___0 [L6071] dev->udev = udev [L6072] dev->net = netdev [L6073] dev->intf = intf [L6074] CALL, EXPR usb_altnum_to_altsetting((struct usb_interface const *)intf, 1U) [L6924] CALL, EXPR ldv_malloc(sizeof(struct usb_host_interface)) VAL [={0:0}, ={0:0}, \old(size)=25, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5441] void *p ; [L5442] void *tmp ; [L5443] int tmp___0 ; [L5445] tmp___0 = __VERIFIER_nondet_int() [L5446] COND FALSE !(tmp___0 != 0) [L5449] tmp = malloc(size) [L5450] p = tmp VAL [={0:0}, ={0:0}, \old(size)=25, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934591:0}, ref_cnt=0, SERIAL_STATE=0, size=25, tmp={-8589934591:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5437] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=25, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934591:0}, ref_cnt=0, SERIAL_STATE=0, size=25, tmp={-8589934591:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5452] return (p); VAL [={0:0}, ={0:0}, \old(size)=25, \result={-8589934591:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-8589934591:0}, ref_cnt=0, SERIAL_STATE=0, size=25, tmp={-8589934591:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6924] RET, EXPR ldv_malloc(sizeof(struct usb_host_interface)) VAL [={0:0}, ={0:0}, \old(arg1)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, arg0={0:0}, arg0={0:0}, arg1=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_host_interface))={-8589934591:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6924] return ldv_malloc(sizeof(struct usb_host_interface)); [L6074] RET, EXPR usb_altnum_to_altsetting((struct usb_interface const *)intf, 1U) [L6074] hintf = usb_altnum_to_altsetting((struct usb_interface const *)intf, 1U) [L6075] COND FALSE !((unsigned long )hintf == (unsigned long )((struct usb_host_interface *)0)) [L6081] i = 0 VAL [={0:0}, ={0:0}, __constr_expr_0={41:0}, __key={47:0}, __key___0={49:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:3136}, dev_counter=0, hintf={-8589934591:0}, i=0, id={0:0}, id={0:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, netdev={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0={-8589934593:3136}, udev={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6097] EXPR hintf->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __constr_expr_0={41:0}, __key={47:0}, __key___0={49:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:3136}, dev_counter=0, hintf={-8589934591:0}, hintf->desc.bNumEndpoints=0, i=0, id={0:0}, id={0:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, netdev={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0={-8589934593:3136}, udev={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6097] COND FALSE !((int )hintf->desc.bNumEndpoints > i) [L6101] EXPR dev->bulk_in [L6101] (unsigned int )dev->bulk_in == 0U || (unsigned int )dev->bulk_out == 0U [L6101] EXPR dev->bulk_out [L6101] (unsigned int )dev->bulk_in == 0U || (unsigned int )dev->bulk_out == 0U VAL [={0:0}, ={0:0}, (unsigned int )dev->bulk_in == 0U || (unsigned int )dev->bulk_out == 0U=0, __constr_expr_0={41:0}, __key={47:0}, __key___0={49:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:3136}, dev->bulk_in=257, dev->bulk_out=-255, dev_counter=0, hintf={-8589934591:0}, i=0, id={0:0}, id={0:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, netdev={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0={-8589934593:3136}, udev={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6101] COND FALSE !((unsigned int )dev->bulk_in == 0U || (unsigned int )dev->bulk_out == 0U) [L6107] CALL, EXPR kmalloc(64UL, 208U) [L5425] void *tmp___2 ; [L5427] CALL, EXPR __kmalloc(size, flags) [L5420] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5441] void *p ; [L5442] void *tmp ; [L5443] int tmp___0 ; [L5445] tmp___0 = __VERIFIER_nondet_int() [L5446] COND FALSE !(tmp___0 != 0) [L5449] tmp = malloc(size) [L5450] p = tmp VAL [={0:0}, ={0:0}, \old(size)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=64, tmp={-4294967295:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5437] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5451] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=64, tmp={-4294967295:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5452] return (p); VAL [={0:0}, ={0:0}, \old(size)=64, \result={-4294967295:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=64, tmp={-4294967295:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5420] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=64, \old(t)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-4294967295:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=64, t=208, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5420] return ldv_malloc(size); [L5427] RET, EXPR __kmalloc(size, flags) [L5427] tmp___2 = __kmalloc(size, flags) [L5428] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=64, \result={-4294967295:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, size=64, tmp___2={-4294967295:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6107] RET, EXPR kmalloc(64UL, 208U) [L6107] tmp___3 = kmalloc(64UL, 208U) [L6108] dev->ctrl_buf = (unsigned char *)tmp___3 [L6109] EXPR dev->ctrl_buf VAL [={0:0}, ={0:0}, __constr_expr_0={41:0}, __key={47:0}, __key___0={49:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-8589934593:3136}, dev->ctrl_buf={-4294967295:0}, dev_counter=0, hintf={-8589934591:0}, i=0, id={0:0}, id={0:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, netdev={-8589934593:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967297:0}, tmp___0={-8589934593:3136}, tmp___3={-4294967295:0}, udev={-4294967297:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6109] COND FALSE !((unsigned long )dev->ctrl_buf == (unsigned long )((unsigned char *)0U)) [L6114] CALL ipheth_get_macaddr(dev) [L5863] struct usb_device *udev ; [L5864] struct net_device *net ; [L5865] int retval ; [L5866] unsigned int tmp ; [L5867] size_t __len ; [L5868] void *__ret ; [L5870] EXPR dev->udev [L5870] udev = dev->udev [L5871] EXPR dev->net [L5871] net = dev->net [L5872] CALL __create_pipe(udev, 0U) VAL [={0:0}, ={0:0}, \old(endpoint)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-4294967297:0}, dev_counter=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5406] EXPR dev->devnum VAL [={0:0}, ={0:0}, \old(endpoint)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-4294967297:0}, dev={-4294967297:0}, dev->devnum=8388608, dev_counter=0, endpoint=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5406] dev->devnum << 8 VAL [={0:0}, ={0:0}, \old(endpoint)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={8388623:8388629}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-4294967297:0}, dev={-4294967297:0}, dev->devnum=8388608, dev_counter=0, endpoint=0, INTERF_STATE=0, ipheth_driver={39:0}, ipheth_driver_group1={0:0}, ipheth_netdev_ops={38:0}, ipheth_netdev_ops_group1={0:0}, ipheth_table={37:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 6657]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6657]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5406]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6095]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6095]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6266]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6266]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6389]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6389]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6400]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6400]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6401]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6401]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 38 procedures, 563 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 140.3s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 69.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17659 SdHoareTripleChecker+Valid, 50.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16898 mSDsluCounter, 88112 SdHoareTripleChecker+Invalid, 43.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3335 IncrementalHoareTripleChecker+Unchecked, 74365 mSDsCounter, 7120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47958 IncrementalHoareTripleChecker+Invalid, 58413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7120 mSolverCounterUnsat, 13747 mSDtfsCounter, 47958 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 1512 SyntacticMatches, 0 SemanticMatches, 541 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 6314 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3931occurred in iteration=12, InterpolantAutomatonStates: 372, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 16102 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 2535 NumberOfCodeBlocks, 2535 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2492 ConstructedInterpolants, 16 QuantifiedInterpolants, 12158 SizeOfPredicates, 70 NumberOfNonLiveVariables, 13613 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 1304/1532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-16 13:06:21,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...