/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-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:10:05,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:10:05,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:10:05,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:10:05,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:10:05,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:10:05,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:10:05,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:10:05,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:10:05,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:10:05,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:10:05,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:10:05,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:10:05,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:10:05,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:10:05,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:10:05,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:10:05,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:10:05,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:10:05,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:10:05,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:10:05,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:10:05,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:10:05,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:10:05,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:10:05,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:10:05,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:10:05,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:10:05,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:10:05,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:10:05,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:10:05,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:10:05,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:10:05,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:10:05,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:10:05,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:10:05,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:10:05,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:10:05,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:10:05,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:10:05,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:10:05,630 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 14:10:05,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:10:05,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:10:05,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:10:05,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:10:05,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:10:05,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:10:05,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:10:05,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:10:05,673 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:10:05,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:10:05,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:10:05,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:10:05,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:10:05,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:10:05,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:10:05,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:10:05,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:10:05,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:10:05,675 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:10:05,675 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:10:05,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:10:05,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:10:05,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:10:05,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:10:05,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:10:05,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:10:05,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:10:05,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:10:05,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:10:05,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:10:05,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:10:05,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:10:05,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:10:05,679 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 14:10:06,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:10:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:10:06,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:10:06,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:10:06,085 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:10:06,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:06,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8a49c4d/f67a9b818ed04fcbbc56e963543a82a8/FLAGcd7b76446 [2022-10-16 14:10:07,115 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:10:07,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:07,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8a49c4d/f67a9b818ed04fcbbc56e963543a82a8/FLAGcd7b76446 [2022-10-16 14:10:07,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8a49c4d/f67a9b818ed04fcbbc56e963543a82a8 [2022-10-16 14:10:07,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:10:07,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:10:07,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:10:07,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:10:07,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:10:07,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:10:07" (1/1) ... [2022-10-16 14:10:07,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a79ad6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:07, skipping insertion in model container [2022-10-16 14:10:07,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:10:07" (1/1) ... [2022-10-16 14:10:07,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:10:07,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:10:08,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-10-16 14:10:08,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:10:08,652 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:10:08,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-10-16 14:10:08,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:10:08,858 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:10:08,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08 WrapperNode [2022-10-16 14:10:08,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:10:08,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:10:08,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:10:08,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:10:08,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:08,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:08,970 INFO L138 Inliner]: procedures = 109, calls = 313, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 791 [2022-10-16 14:10:08,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:10:08,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:10:08,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:10:08,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:10:08,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:08,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:08,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,100 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:10:09,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:10:09,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:10:09,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:10:09,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (1/1) ... [2022-10-16 14:10:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:10:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:09,183 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 14:10:09,198 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 14:10:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 14:10:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 14:10:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:10:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-16 14:10:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-16 14:10:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 14:10:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 14:10:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 14:10:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 14:10:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-10-16 14:10:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-10-16 14:10:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:10:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 14:10:09,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 14:10:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 14:10:09,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 14:10:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-10-16 14:10:09,262 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-10-16 14:10:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-10-16 14:10:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-10-16 14:10:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 14:10:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 14:10:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 14:10:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:10:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-16 14:10:09,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-16 14:10:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 14:10:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-10-16 14:10:09,264 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-10-16 14:10:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-10-16 14:10:09,264 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-10-16 14:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-10-16 14:10:09,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-10-16 14:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 14:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 14:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-10-16 14:10:09,266 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-10-16 14:10:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-10-16 14:10:09,266 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-10-16 14:10:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:10:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:10:09,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:10:09,684 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:10:09,687 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:10:09,785 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 14:10:10,602 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:10:10,621 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:10:10,622 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 14:10:10,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:10:10 BoogieIcfgContainer [2022-10-16 14:10:10,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:10:10,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:10:10,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:10:10,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:10:10,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:10:07" (1/3) ... [2022-10-16 14:10:10,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1609f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:10:10, skipping insertion in model container [2022-10-16 14:10:10,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:08" (2/3) ... [2022-10-16 14:10:10,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1609f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:10:10, skipping insertion in model container [2022-10-16 14:10:10,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:10:10" (3/3) ... [2022-10-16 14:10:10,642 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:10,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:10:10,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-10-16 14:10:10,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:10:10,766 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;@4f92a92a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:10:10,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-10-16 14:10:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 187 states have (on average 1.358288770053476) internal successors, (254), 207 states have internal predecessors, (254), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-10-16 14:10:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 14:10:10,790 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:10,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:10,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 740965027, now seen corresponding path program 1 times [2022-10-16 14:10:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:10,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756174867] [2022-10-16 14:10:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 14:10:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:10:11,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:11,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756174867] [2022-10-16 14:10:11,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756174867] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:11,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:11,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:10:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630550141] [2022-10-16 14:10:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:11,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:11,411 INFO L87 Difference]: Start difference. First operand has 256 states, 187 states have (on average 1.358288770053476) internal successors, (254), 207 states have internal predecessors, (254), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:11,856 INFO L93 Difference]: Finished difference Result 514 states and 690 transitions. [2022-10-16 14:10:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:10:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-10-16 14:10:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:11,880 INFO L225 Difference]: With dead ends: 514 [2022-10-16 14:10:11,881 INFO L226 Difference]: Without dead ends: 239 [2022-10-16 14:10:11,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 14:10:11,891 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 97 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:11,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 700 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:10:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-16 14:10:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-10-16 14:10:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 184 states have internal predecessors, (227), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-10-16 14:10:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2022-10-16 14:10:11,970 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 37 [2022-10-16 14:10:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:11,971 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2022-10-16 14:10:11,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2022-10-16 14:10:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 14:10:11,974 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:11,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:11,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:10:11,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 803004641, now seen corresponding path program 1 times [2022-10-16 14:10:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:11,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858159945] [2022-10-16 14:10:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 14:10:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:10:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858159945] [2022-10-16 14:10:12,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858159945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:12,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:12,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 14:10:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310113886] [2022-10-16 14:10:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:12,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:10:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:10:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:10:12,227 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:12,691 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2022-10-16 14:10:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:10:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-10-16 14:10:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:12,696 INFO L225 Difference]: With dead ends: 494 [2022-10-16 14:10:12,696 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 14:10:12,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:12,700 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 177 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:12,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 819 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 14:10:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2022-10-16 14:10:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 195 states have (on average 1.3076923076923077) internal successors, (255), 206 states have internal predecessors, (255), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-10-16 14:10:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 329 transitions. [2022-10-16 14:10:12,729 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 329 transitions. Word has length 37 [2022-10-16 14:10:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:12,730 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 329 transitions. [2022-10-16 14:10:12,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2022-10-16 14:10:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 14:10:12,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:12,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:12,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:10:12,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -185703341, now seen corresponding path program 1 times [2022-10-16 14:10:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527606923] [2022-10-16 14:10:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 14:10:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-16 14:10:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:13,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527606923] [2022-10-16 14:10:13,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527606923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:13,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:13,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:10:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529188132] [2022-10-16 14:10:13,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:13,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:10:13,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:13,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:10:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:10:13,035 INFO L87 Difference]: Start difference. First operand 259 states and 329 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 4 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 14:10:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:13,680 INFO L93 Difference]: Finished difference Result 513 states and 663 transitions. [2022-10-16 14:10:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:10:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 4 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 69 [2022-10-16 14:10:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:13,686 INFO L225 Difference]: With dead ends: 513 [2022-10-16 14:10:13,687 INFO L226 Difference]: Without dead ends: 509 [2022-10-16 14:10:13,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:13,689 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 324 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:13,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 997 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 14:10:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-10-16 14:10:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 489. [2022-10-16 14:10:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 377 states have (on average 1.3076923076923077) internal successors, (493), 390 states have internal predecessors, (493), 71 states have call successors, (71), 31 states have call predecessors, (71), 31 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-10-16 14:10:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 635 transitions. [2022-10-16 14:10:13,735 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 635 transitions. Word has length 69 [2022-10-16 14:10:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:13,736 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 635 transitions. [2022-10-16 14:10:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 4 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 14:10:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 635 transitions. [2022-10-16 14:10:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 14:10:13,739 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:13,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:13,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:10:13,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -111733358, now seen corresponding path program 1 times [2022-10-16 14:10:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:13,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821047906] [2022-10-16 14:10:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 14:10:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 14:10:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821047906] [2022-10-16 14:10:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821047906] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:14,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 14:10:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083605679] [2022-10-16 14:10:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:14,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:10:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:14,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:10:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:10:14,024 INFO L87 Difference]: Start difference. First operand 489 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 14:10:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:14,563 INFO L93 Difference]: Finished difference Result 982 states and 1285 transitions. [2022-10-16 14:10:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 14:10:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 71 [2022-10-16 14:10:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:14,569 INFO L225 Difference]: With dead ends: 982 [2022-10-16 14:10:14,569 INFO L226 Difference]: Without dead ends: 512 [2022-10-16 14:10:14,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-10-16 14:10:14,572 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 296 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:14,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 884 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-10-16 14:10:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 496. [2022-10-16 14:10:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 399 states have internal predecessors, (503), 67 states have call successors, (67), 33 states have call predecessors, (67), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-10-16 14:10:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 637 transitions. [2022-10-16 14:10:14,615 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 637 transitions. Word has length 71 [2022-10-16 14:10:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:14,616 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 637 transitions. [2022-10-16 14:10:14,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 14:10:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 637 transitions. [2022-10-16 14:10:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 14:10:14,618 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:14,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 14:10:14,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1982112155, now seen corresponding path program 1 times [2022-10-16 14:10:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949183231] [2022-10-16 14:10:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 14:10:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-16 14:10:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:14,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949183231] [2022-10-16 14:10:14,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949183231] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:14,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:14,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 14:10:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387722964] [2022-10-16 14:10:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:14,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:10:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:10:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:14,871 INFO L87 Difference]: Start difference. First operand 496 states and 637 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:10:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:15,376 INFO L93 Difference]: Finished difference Result 1316 states and 1738 transitions. [2022-10-16 14:10:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:10:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2022-10-16 14:10:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:15,390 INFO L225 Difference]: With dead ends: 1316 [2022-10-16 14:10:15,390 INFO L226 Difference]: Without dead ends: 852 [2022-10-16 14:10:15,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:10:15,399 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 424 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:15,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1641 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-10-16 14:10:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 502. [2022-10-16 14:10:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 392 states have (on average 1.2984693877551021) internal successors, (509), 405 states have internal predecessors, (509), 67 states have call successors, (67), 33 states have call predecessors, (67), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-10-16 14:10:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 643 transitions. [2022-10-16 14:10:15,469 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 643 transitions. Word has length 72 [2022-10-16 14:10:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:15,470 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 643 transitions. [2022-10-16 14:10:15,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:10:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 643 transitions. [2022-10-16 14:10:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 14:10:15,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:15,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 14:10:15,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1575783582, now seen corresponding path program 1 times [2022-10-16 14:10:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:15,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381190098] [2022-10-16 14:10:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 14:10:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-10-16 14:10:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 14:10:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-16 14:10:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381190098] [2022-10-16 14:10:15,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381190098] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:15,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:15,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 14:10:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153694457] [2022-10-16 14:10:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:10:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:10:15,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:15,994 INFO L87 Difference]: Start difference. First operand 502 states and 643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:10:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:16,477 INFO L93 Difference]: Finished difference Result 996 states and 1288 transitions. [2022-10-16 14:10:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 14:10:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 74 [2022-10-16 14:10:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:16,483 INFO L225 Difference]: With dead ends: 996 [2022-10-16 14:10:16,484 INFO L226 Difference]: Without dead ends: 526 [2022-10-16 14:10:16,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 14:10:16,486 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 139 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:16,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1247 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-10-16 14:10:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 510. [2022-10-16 14:10:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 398 states have (on average 1.2939698492462313) internal successors, (515), 411 states have internal predecessors, (515), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (77), 69 states have call predecessors, (77), 67 states have call successors, (77) [2022-10-16 14:10:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 659 transitions. [2022-10-16 14:10:16,527 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 659 transitions. Word has length 74 [2022-10-16 14:10:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:16,527 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 659 transitions. [2022-10-16 14:10:16,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 14:10:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 659 transitions. [2022-10-16 14:10:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 14:10:16,529 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:16,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:16,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 14:10:16,530 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-16 14:10:16,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1210529236, now seen corresponding path program 1 times [2022-10-16 14:10:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:16,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072449526] [2022-10-16 14:10:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 14:10:16,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 14:10:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 14:10:16,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 14:10:16,994 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 14:10:16,995 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-10-16 14:10:16,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location usb_acecad_disconnectErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-10-16 14:10:16,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location usb_acecad_disconnectErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-10-16 14:10:16,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-10-16 14:10:16,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-10-16 14:10:16,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-10-16 14:10:16,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-10-16 14:10:16,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-10-16 14:10:16,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-10-16 14:10:16,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-10-16 14:10:16,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 14:10:17,004 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:17,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 14:10:17,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:10:17 BoogieIcfgContainer [2022-10-16 14:10:17,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 14:10:17,173 INFO L158 Benchmark]: Toolchain (without parser) took 9524.78ms. Allocated memory was 152.0MB in the beginning and 260.0MB in the end (delta: 108.0MB). Free memory was 122.5MB in the beginning and 113.2MB in the end (delta: 9.2MB). Peak memory consumption was 118.6MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,173 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 152.0MB. Free memory was 124.4MB in the beginning and 124.3MB in the end (delta: 147.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 14:10:17,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1205.12ms. Allocated memory is still 152.0MB. Free memory was 122.3MB in the beginning and 83.9MB in the end (delta: 38.4MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.24ms. Allocated memory is still 152.0MB. Free memory was 83.9MB in the beginning and 77.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,174 INFO L158 Benchmark]: Boogie Preprocessor took 162.76ms. Allocated memory is still 152.0MB. Free memory was 77.6MB in the beginning and 71.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,175 INFO L158 Benchmark]: RCFGBuilder took 1490.80ms. Allocated memory was 152.0MB in the beginning and 216.0MB in the end (delta: 64.0MB). Free memory was 71.3MB in the beginning and 142.1MB in the end (delta: -70.8MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,175 INFO L158 Benchmark]: TraceAbstraction took 6540.60ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 141.6MB in the beginning and 113.2MB in the end (delta: 28.3MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. [2022-10-16 14:10:17,177 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 152.0MB. Free memory was 124.4MB in the beginning and 124.3MB in the end (delta: 147.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1205.12ms. Allocated memory is still 152.0MB. Free memory was 122.3MB in the beginning and 83.9MB in the end (delta: 38.4MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 111.24ms. Allocated memory is still 152.0MB. Free memory was 83.9MB in the beginning and 77.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 162.76ms. Allocated memory is still 152.0MB. Free memory was 77.6MB in the beginning and 71.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1490.80ms. Allocated memory was 152.0MB in the beginning and 216.0MB in the end (delta: 64.0MB). Free memory was 71.3MB in the beginning and 142.1MB in the end (delta: -70.8MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6540.60ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 141.6MB in the beginning and 113.2MB in the end (delta: 28.3MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. * 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 - UnprovableResult [Line: 3383]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 3839, overapproximation of bitwiseAnd at line 3309. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_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}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] int tmp___2 ; 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={4294967297:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={4294967297:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \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, bulk_urb={0:0}, calloc(1UL, size)={4294967297:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={4294967297:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] RET, EXPR ldv_init_zalloc(24UL) 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={4294967297:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] ldv_state_variable_0 = 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] 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, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={8589934593:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={8589934593:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, calloc(1UL, size)={8589934593:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={8589934593:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={8589934593:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] RET, EXPR ldv_init_zalloc(1248UL) 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={8589934593:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] usb_acecad_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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={8589934593:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={15:0}, ldv_func_arg1={15:0}, ldv_func_arg2={8589934595:8589934598}, ldv_func_arg2={8589934595:8589934598}, ldv_func_arg3={4:0}, ldv_func_arg3={4:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, driver={15:0}, driver={15:0}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] return (result); 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={4294967297:0}, ref_cnt=0, SERIAL_STATE=0, tmp={4294967297:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1070, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1070, \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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-4294967295:0}, ref_cnt=0, SERIAL_STATE=0, size=1070, tmp={-4294967295:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-4294967295:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-4294967295:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={8589934593:0}, intf={8589934593:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967295:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] EXPR interface->desc.bNumEndpoints 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, DEV_STATE=0, id={4294967297:0}, id={4294967297:0}, int_urb={0:0}, INTERF_STATE=0, interface={8589934597:-11}, interface->desc.bNumEndpoints=257, intf={8589934593:0}, intf={8589934593:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-4294967295:0}, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] tmp___1 = 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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, epd={8589934596:59}, epd={8589934596:59}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] return (tmp___1); VAL [={0:0}, ={0:0}, \result=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, __this_module={8589934595:8589934598}, bulk_urb={0:0}, DEV_STATE=0, epd={8589934596:59}, epd={8589934596:59}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum VAL [={0:0}, ={0:0}, \old(endpoint)=128, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, dev={-4294967295:0}, dev->devnum=8388608, DEV_STATE=0, endpoint=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] [L3383] dev->devnum << 8 VAL [={0:0}, ={0:0}, \old(endpoint)=128, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={8589934595:8589934598}, bulk_urb={0:0}, dev={-4294967295:0}, dev={-4294967295:0}, dev->devnum=8388608, DEV_STATE=0, endpoint=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={15:0}, usb_acecad_driver_group1={8589934593:0}, usb_acecad_id_table={14:0}, usb_counter=0, usb_intfdata={0:0}] - UnprovableResult [Line: 4110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3383]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4099]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4099]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3904]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3904]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3914]: 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 17 procedures, 257 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1538 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1457 mSDsluCounter, 6288 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4395 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1770 IncrementalHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 1893 mSDtfsCounter, 1770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 64/64 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 could not prove your program: unable to determine feasibility of some traces [2022-10-16 14:10:17,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...