/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:14:54,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:14:54,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:14:54,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:14:54,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:14:54,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:14:54,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:14:54,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:14:54,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:14:54,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:14:54,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:14:54,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:14:54,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:14:54,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:14:54,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:14:54,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:14:54,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:14:54,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:14:54,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:14:54,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:14:54,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:14:54,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:14:54,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:14:54,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:14:54,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:14:54,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:14:54,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:14:54,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:14:54,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:14:54,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:14:54,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:14:54,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:14:54,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:14:54,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:14:54,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:14:54,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:14:54,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:14:54,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:14:54,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:14:54,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:14:54,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:14:54,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:14:54,634 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:14:54,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:14:54,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:14:54,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:14:54,640 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:14:54,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:14:54,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:14:54,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:14:54,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:14:54,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:14:54,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:14:54,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:14:54,643 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:14:54,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:14:54,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:14:54,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:14:54,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:14:54,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:14:54,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:14:54,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:14:54,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:14:54,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:14:54,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:14:54,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:14:54,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:14:54,646 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-bitabs/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 [2021-01-07 00:14:55,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:14:55,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:14:55,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:14:55,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:14:55,132 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:14:55,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-01-07 00:14:55,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/550e009e3/8a1fe77c325c4584bfcb9380a4990809/FLAG3e21abd41 [2021-01-07 00:14:56,135 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:14:56,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-01-07 00:14:56,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/550e009e3/8a1fe77c325c4584bfcb9380a4990809/FLAG3e21abd41 [2021-01-07 00:14:56,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/550e009e3/8a1fe77c325c4584bfcb9380a4990809 [2021-01-07 00:14:56,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:14:56,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:14:56,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:14:56,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:14:56,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:14:56,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:14:56" (1/1) ... [2021-01-07 00:14:56,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668990bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:56, skipping insertion in model container [2021-01-07 00:14:56,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:14:56" (1/1) ... [2021-01-07 00:14:56,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:14:56,405 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~actual~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],StructAccessExpression[IdentifierExpression[~id,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~pressure~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem51,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[#t~mem51,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~3,] left hand side expression in assignment: lhs: VariableLHS[~input_dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[798],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[544],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~9,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~4,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~11,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~3,] left hand side expression in assignment: lhs: VariableLHS[~res_kbtab_probe_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] [2021-01-07 00:14:57,575 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~13,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] [2021-01-07 00:14:57,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:14:57,720 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~actual~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],StructAccessExpression[IdentifierExpression[~id,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~id,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~id,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~pressure~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem53,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[#t~mem53,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~3,] left hand side expression in assignment: lhs: VariableLHS[~input_dev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~kbtab~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~kbtab~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[798],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[536],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[544],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~input_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~input_dev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem82,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem82,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~9,] left hand side expression in assignment: lhs: VariableLHS[~kbtab~4,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~11,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~3,] left hand side expression in assignment: lhs: VariableLHS[~res_kbtab_probe_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_kbtab_driver_usb_driver~0,] [2021-01-07 00:14:57,980 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~13,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] [2021-01-07 00:14:57,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:14:58,051 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:14:58,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58 WrapperNode [2021-01-07 00:14:58,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:14:58,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:14:58,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:14:58,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:14:58,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:14:58,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:14:58,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:14:58,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:14:58,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... [2021-01-07 00:14:58,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:14:58,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:14:58,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:14:58,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:14:58,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:14:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:14:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:14:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:14:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:14:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:14:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:14:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:14:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:14:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:14:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:14:58,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:14:59,301 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 00:15:00,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-01-07 00:15:00,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-01-07 00:15:00,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:15:00,439 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2021-01-07 00:15:00,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:00 BoogieIcfgContainer [2021-01-07 00:15:00,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:15:00,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:15:00,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:15:00,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:15:00,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:14:56" (1/3) ... [2021-01-07 00:15:00,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680204b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:15:00, skipping insertion in model container [2021-01-07 00:15:00,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:14:58" (2/3) ... [2021-01-07 00:15:00,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680204b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:15:00, skipping insertion in model container [2021-01-07 00:15:00,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:00" (3/3) ... [2021-01-07 00:15:00,451 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-01-07 00:15:00,459 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:15:00,465 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 00:15:00,485 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 00:15:00,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:15:00,516 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:15:00,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:15:00,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:15:00,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:15:00,517 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:15:00,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:15:00,517 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:15:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-01-07 00:15:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 00:15:00,545 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:00,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:00,547 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2021-01-07 00:15:00,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:00,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847472178] [2021-01-07 00:15:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:01,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847472178] [2021-01-07 00:15:01,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:01,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:15:01,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734878373] [2021-01-07 00:15:01,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:01,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:01,131 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2021-01-07 00:15:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:01,253 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2021-01-07 00:15:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:01,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-07 00:15:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:01,280 INFO L225 Difference]: With dead ends: 360 [2021-01-07 00:15:01,281 INFO L226 Difference]: Without dead ends: 226 [2021-01-07 00:15:01,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-01-07 00:15:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-01-07 00:15:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 00:15:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2021-01-07 00:15:01,393 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2021-01-07 00:15:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:01,394 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2021-01-07 00:15:01,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2021-01-07 00:15:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 00:15:01,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:01,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:01,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:15:01,396 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2021-01-07 00:15:01,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:01,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942544975] [2021-01-07 00:15:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:01,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942544975] [2021-01-07 00:15:01,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:01,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:15:01,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486453733] [2021-01-07 00:15:01,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:01,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:01,577 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand 3 states. [2021-01-07 00:15:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:01,649 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2021-01-07 00:15:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:01,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-01-07 00:15:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:01,654 INFO L225 Difference]: With dead ends: 630 [2021-01-07 00:15:01,655 INFO L226 Difference]: Without dead ends: 418 [2021-01-07 00:15:01,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-07 00:15:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2021-01-07 00:15:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2021-01-07 00:15:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2021-01-07 00:15:01,721 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2021-01-07 00:15:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:01,721 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2021-01-07 00:15:01,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2021-01-07 00:15:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:15:01,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:01,724 INFO L422 BasicCegarLoop]: 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] [2021-01-07 00:15:01,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:15:01,724 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2021-01-07 00:15:01,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:01,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935797063] [2021-01-07 00:15:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:01,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935797063] [2021-01-07 00:15:01,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:01,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:01,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944656836] [2021-01-07 00:15:01,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:01,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:01,890 INFO L87 Difference]: Start difference. First operand 404 states and 510 transitions. Second operand 5 states. [2021-01-07 00:15:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:02,021 INFO L93 Difference]: Finished difference Result 922 states and 1192 transitions. [2021-01-07 00:15:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:15:02,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-07 00:15:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:02,025 INFO L225 Difference]: With dead ends: 922 [2021-01-07 00:15:02,025 INFO L226 Difference]: Without dead ends: 525 [2021-01-07 00:15:02,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-01-07 00:15:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 475. [2021-01-07 00:15:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2021-01-07 00:15:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 611 transitions. [2021-01-07 00:15:02,051 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 611 transitions. Word has length 28 [2021-01-07 00:15:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:02,051 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 611 transitions. [2021-01-07 00:15:02,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 611 transitions. [2021-01-07 00:15:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 00:15:02,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:02,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:02,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:15:02,054 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2021-01-07 00:15:02,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:02,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143550643] [2021-01-07 00:15:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:02,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143550643] [2021-01-07 00:15:02,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:02,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:15:02,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291551302] [2021-01-07 00:15:02,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:15:02,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:15:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:02,252 INFO L87 Difference]: Start difference. First operand 475 states and 611 transitions. Second operand 7 states. [2021-01-07 00:15:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:03,056 INFO L93 Difference]: Finished difference Result 2911 states and 3713 transitions. [2021-01-07 00:15:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:15:03,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-01-07 00:15:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:03,071 INFO L225 Difference]: With dead ends: 2911 [2021-01-07 00:15:03,071 INFO L226 Difference]: Without dead ends: 2445 [2021-01-07 00:15:03,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:15:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2021-01-07 00:15:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 519. [2021-01-07 00:15:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2021-01-07 00:15:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 659 transitions. [2021-01-07 00:15:03,166 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 659 transitions. Word has length 46 [2021-01-07 00:15:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:03,167 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 659 transitions. [2021-01-07 00:15:03,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:15:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 659 transitions. [2021-01-07 00:15:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 00:15:03,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:03,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:03,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:15:03,177 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2021-01-07 00:15:03,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:03,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745867523] [2021-01-07 00:15:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:03,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745867523] [2021-01-07 00:15:03,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:03,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:03,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240574695] [2021-01-07 00:15:03,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:03,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:03,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:03,360 INFO L87 Difference]: Start difference. First operand 519 states and 659 transitions. Second operand 5 states. [2021-01-07 00:15:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:03,801 INFO L93 Difference]: Finished difference Result 2758 states and 3486 transitions. [2021-01-07 00:15:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:15:03,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2021-01-07 00:15:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:03,814 INFO L225 Difference]: With dead ends: 2758 [2021-01-07 00:15:03,815 INFO L226 Difference]: Without dead ends: 2491 [2021-01-07 00:15:03,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:15:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2021-01-07 00:15:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 531. [2021-01-07 00:15:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2021-01-07 00:15:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2021-01-07 00:15:03,913 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 46 [2021-01-07 00:15:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:03,914 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2021-01-07 00:15:03,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2021-01-07 00:15:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 00:15:03,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:03,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:03,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 00:15:03,918 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2021-01-07 00:15:03,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:03,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733238538] [2021-01-07 00:15:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:04,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733238538] [2021-01-07 00:15:04,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:04,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:15:04,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428548180] [2021-01-07 00:15:04,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:15:04,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:15:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:04,093 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand 7 states. [2021-01-07 00:15:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:04,420 INFO L93 Difference]: Finished difference Result 1148 states and 1445 transitions. [2021-01-07 00:15:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:15:04,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-01-07 00:15:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:04,428 INFO L225 Difference]: With dead ends: 1148 [2021-01-07 00:15:04,428 INFO L226 Difference]: Without dead ends: 875 [2021-01-07 00:15:04,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:15:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-01-07 00:15:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 535. [2021-01-07 00:15:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2021-01-07 00:15:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 675 transitions. [2021-01-07 00:15:04,503 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 675 transitions. Word has length 46 [2021-01-07 00:15:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:04,506 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 675 transitions. [2021-01-07 00:15:04,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:15:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 675 transitions. [2021-01-07 00:15:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:15:04,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:04,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:04,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 00:15:04,508 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2021-01-07 00:15:04,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:04,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603474310] [2021-01-07 00:15:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:04,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603474310] [2021-01-07 00:15:04,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:04,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:04,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846067658] [2021-01-07 00:15:04,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:04,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:04,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:04,625 INFO L87 Difference]: Start difference. First operand 535 states and 675 transitions. Second operand 5 states. [2021-01-07 00:15:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:05,135 INFO L93 Difference]: Finished difference Result 2870 states and 3617 transitions. [2021-01-07 00:15:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:15:05,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 00:15:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:05,148 INFO L225 Difference]: With dead ends: 2870 [2021-01-07 00:15:05,149 INFO L226 Difference]: Without dead ends: 2595 [2021-01-07 00:15:05,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:15:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-01-07 00:15:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 547. [2021-01-07 00:15:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2021-01-07 00:15:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 687 transitions. [2021-01-07 00:15:05,248 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 687 transitions. Word has length 51 [2021-01-07 00:15:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:05,248 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 687 transitions. [2021-01-07 00:15:05,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 687 transitions. [2021-01-07 00:15:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:15:05,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:05,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:05,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 00:15:05,250 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2021-01-07 00:15:05,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:05,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022575588] [2021-01-07 00:15:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:05,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022575588] [2021-01-07 00:15:05,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:05,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:15:05,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827434736] [2021-01-07 00:15:05,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:05,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:05,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:05,367 INFO L87 Difference]: Start difference. First operand 547 states and 687 transitions. Second operand 4 states. [2021-01-07 00:15:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:05,516 INFO L93 Difference]: Finished difference Result 1153 states and 1451 transitions. [2021-01-07 00:15:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:05,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-07 00:15:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:05,520 INFO L225 Difference]: With dead ends: 1153 [2021-01-07 00:15:05,521 INFO L226 Difference]: Without dead ends: 615 [2021-01-07 00:15:05,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-01-07 00:15:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 376. [2021-01-07 00:15:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2021-01-07 00:15:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2021-01-07 00:15:05,598 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 51 [2021-01-07 00:15:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:05,598 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2021-01-07 00:15:05,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2021-01-07 00:15:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:15:05,599 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:05,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:05,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 00:15:05,600 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:05,601 INFO L82 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2021-01-07 00:15:05,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:05,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487127227] [2021-01-07 00:15:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:05,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487127227] [2021-01-07 00:15:05,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:05,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:05,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639241485] [2021-01-07 00:15:05,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:05,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:05,762 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 4 states. [2021-01-07 00:15:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:05,946 INFO L93 Difference]: Finished difference Result 660 states and 818 transitions. [2021-01-07 00:15:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:05,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-07 00:15:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:05,951 INFO L225 Difference]: With dead ends: 660 [2021-01-07 00:15:05,951 INFO L226 Difference]: Without dead ends: 656 [2021-01-07 00:15:05,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-01-07 00:15:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 634. [2021-01-07 00:15:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2021-01-07 00:15:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 795 transitions. [2021-01-07 00:15:06,051 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 795 transitions. Word has length 51 [2021-01-07 00:15:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:06,051 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 795 transitions. [2021-01-07 00:15:06,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 795 transitions. [2021-01-07 00:15:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:15:06,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:06,053 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-07 00:15:06,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 00:15:06,053 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:06,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2021-01-07 00:15:06,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:06,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037252470] [2021-01-07 00:15:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:06,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037252470] [2021-01-07 00:15:06,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:06,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:06,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965208884] [2021-01-07 00:15:06,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:06,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:06,156 INFO L87 Difference]: Start difference. First operand 634 states and 795 transitions. Second operand 5 states. [2021-01-07 00:15:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:06,351 INFO L93 Difference]: Finished difference Result 1281 states and 1598 transitions. [2021-01-07 00:15:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:15:06,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-01-07 00:15:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:06,355 INFO L225 Difference]: With dead ends: 1281 [2021-01-07 00:15:06,356 INFO L226 Difference]: Without dead ends: 635 [2021-01-07 00:15:06,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-01-07 00:15:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 580. [2021-01-07 00:15:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2021-01-07 00:15:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 727 transitions. [2021-01-07 00:15:06,483 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 727 transitions. Word has length 52 [2021-01-07 00:15:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:06,483 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 727 transitions. [2021-01-07 00:15:06,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 727 transitions. [2021-01-07 00:15:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:15:06,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:06,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:06,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 00:15:06,484 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2021-01-07 00:15:06,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:06,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707503167] [2021-01-07 00:15:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:06,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707503167] [2021-01-07 00:15:06,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:06,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:15:06,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789912928] [2021-01-07 00:15:06,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:15:06,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:15:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:06,610 INFO L87 Difference]: Start difference. First operand 580 states and 727 transitions. Second operand 7 states. [2021-01-07 00:15:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:06,908 INFO L93 Difference]: Finished difference Result 859 states and 1071 transitions. [2021-01-07 00:15:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:15:06,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2021-01-07 00:15:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:06,913 INFO L225 Difference]: With dead ends: 859 [2021-01-07 00:15:06,913 INFO L226 Difference]: Without dead ends: 833 [2021-01-07 00:15:06,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:15:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-01-07 00:15:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 584. [2021-01-07 00:15:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2021-01-07 00:15:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 731 transitions. [2021-01-07 00:15:07,010 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 731 transitions. Word has length 58 [2021-01-07 00:15:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:07,010 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 731 transitions. [2021-01-07 00:15:07,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:15:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 731 transitions. [2021-01-07 00:15:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 00:15:07,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:07,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:07,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 00:15:07,011 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2021-01-07 00:15:07,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:07,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236432403] [2021-01-07 00:15:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:07,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236432403] [2021-01-07 00:15:07,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:07,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:07,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265381794] [2021-01-07 00:15:07,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:07,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:07,133 INFO L87 Difference]: Start difference. First operand 584 states and 731 transitions. Second operand 3 states. [2021-01-07 00:15:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:07,308 INFO L93 Difference]: Finished difference Result 1160 states and 1443 transitions. [2021-01-07 00:15:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:07,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-07 00:15:07,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:07,312 INFO L225 Difference]: With dead ends: 1160 [2021-01-07 00:15:07,312 INFO L226 Difference]: Without dead ends: 613 [2021-01-07 00:15:07,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-01-07 00:15:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 556. [2021-01-07 00:15:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2021-01-07 00:15:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 685 transitions. [2021-01-07 00:15:07,420 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 685 transitions. Word has length 59 [2021-01-07 00:15:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:07,421 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 685 transitions. [2021-01-07 00:15:07,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 685 transitions. [2021-01-07 00:15:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 00:15:07,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:07,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:07,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 00:15:07,422 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2021-01-07 00:15:07,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:07,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502788194] [2021-01-07 00:15:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:07,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502788194] [2021-01-07 00:15:07,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:07,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:07,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26545835] [2021-01-07 00:15:07,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:07,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:07,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:07,595 INFO L87 Difference]: Start difference. First operand 556 states and 685 transitions. Second operand 5 states. [2021-01-07 00:15:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:07,753 INFO L93 Difference]: Finished difference Result 1106 states and 1363 transitions. [2021-01-07 00:15:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:15:07,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-07 00:15:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:07,757 INFO L225 Difference]: With dead ends: 1106 [2021-01-07 00:15:07,757 INFO L226 Difference]: Without dead ends: 556 [2021-01-07 00:15:07,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-01-07 00:15:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2021-01-07 00:15:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2021-01-07 00:15:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 684 transitions. [2021-01-07 00:15:07,864 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 684 transitions. Word has length 61 [2021-01-07 00:15:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:07,865 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 684 transitions. [2021-01-07 00:15:07,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 684 transitions. [2021-01-07 00:15:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 00:15:07,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:07,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:07,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 00:15:07,866 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2021-01-07 00:15:07,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:07,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573941291] [2021-01-07 00:15:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:08,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573941291] [2021-01-07 00:15:08,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:08,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:08,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162356360] [2021-01-07 00:15:08,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:08,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:08,048 INFO L87 Difference]: Start difference. First operand 556 states and 684 transitions. Second operand 4 states. [2021-01-07 00:15:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:08,400 INFO L93 Difference]: Finished difference Result 1528 states and 1890 transitions. [2021-01-07 00:15:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:08,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-07 00:15:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:08,406 INFO L225 Difference]: With dead ends: 1528 [2021-01-07 00:15:08,406 INFO L226 Difference]: Without dead ends: 1182 [2021-01-07 00:15:08,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-01-07 00:15:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 943. [2021-01-07 00:15:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2021-01-07 00:15:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1169 transitions. [2021-01-07 00:15:08,585 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1169 transitions. Word has length 61 [2021-01-07 00:15:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:08,585 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 1169 transitions. [2021-01-07 00:15:08,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1169 transitions. [2021-01-07 00:15:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-07 00:15:08,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:08,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:08,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 00:15:08,587 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2021-01-07 00:15:08,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:08,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024367196] [2021-01-07 00:15:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:08,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024367196] [2021-01-07 00:15:08,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:08,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:15:08,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063405252] [2021-01-07 00:15:08,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:08,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:08,716 INFO L87 Difference]: Start difference. First operand 943 states and 1169 transitions. Second operand 4 states. [2021-01-07 00:15:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:08,876 INFO L93 Difference]: Finished difference Result 1413 states and 1743 transitions. [2021-01-07 00:15:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:08,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-07 00:15:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:08,880 INFO L225 Difference]: With dead ends: 1413 [2021-01-07 00:15:08,880 INFO L226 Difference]: Without dead ends: 547 [2021-01-07 00:15:08,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-01-07 00:15:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 526. [2021-01-07 00:15:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2021-01-07 00:15:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 643 transitions. [2021-01-07 00:15:08,994 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 643 transitions. Word has length 67 [2021-01-07 00:15:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:08,994 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 643 transitions. [2021-01-07 00:15:08,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 643 transitions. [2021-01-07 00:15:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-07 00:15:08,995 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:08,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:08,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 00:15:08,996 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2021-01-07 00:15:08,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:08,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673130363] [2021-01-07 00:15:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:09,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673130363] [2021-01-07 00:15:09,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:09,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:09,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843541197] [2021-01-07 00:15:09,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:09,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:09,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:09,174 INFO L87 Difference]: Start difference. First operand 526 states and 643 transitions. Second operand 4 states. [2021-01-07 00:15:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:09,433 INFO L93 Difference]: Finished difference Result 873 states and 1064 transitions. [2021-01-07 00:15:09,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:09,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-07 00:15:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:09,438 INFO L225 Difference]: With dead ends: 873 [2021-01-07 00:15:09,438 INFO L226 Difference]: Without dead ends: 866 [2021-01-07 00:15:09,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-01-07 00:15:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 783. [2021-01-07 00:15:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2021-01-07 00:15:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 970 transitions. [2021-01-07 00:15:09,597 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 970 transitions. Word has length 67 [2021-01-07 00:15:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:09,597 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 970 transitions. [2021-01-07 00:15:09,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 970 transitions. [2021-01-07 00:15:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-07 00:15:09,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:09,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:09,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 00:15:09,599 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2021-01-07 00:15:09,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:09,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615479518] [2021-01-07 00:15:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:09,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615479518] [2021-01-07 00:15:09,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:09,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:15:09,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966838458] [2021-01-07 00:15:09,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:09,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:09,733 INFO L87 Difference]: Start difference. First operand 783 states and 970 transitions. Second operand 4 states. [2021-01-07 00:15:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:09,957 INFO L93 Difference]: Finished difference Result 911 states and 1130 transitions. [2021-01-07 00:15:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:09,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-07 00:15:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:09,962 INFO L225 Difference]: With dead ends: 911 [2021-01-07 00:15:09,962 INFO L226 Difference]: Without dead ends: 902 [2021-01-07 00:15:09,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-01-07 00:15:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 787. [2021-01-07 00:15:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2021-01-07 00:15:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 970 transitions. [2021-01-07 00:15:10,130 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 970 transitions. Word has length 68 [2021-01-07 00:15:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:10,131 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 970 transitions. [2021-01-07 00:15:10,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 970 transitions. [2021-01-07 00:15:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 00:15:10,132 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:10,132 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:10,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 00:15:10,133 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2021-01-07 00:15:10,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:10,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173175021] [2021-01-07 00:15:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:10,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173175021] [2021-01-07 00:15:10,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778539500] [2021-01-07 00:15:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:15:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:10,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:15:10,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:15:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:10,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 00:15:10,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 00:15:10,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28323932] [2021-01-07 00:15:10,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:10,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:10,984 INFO L87 Difference]: Start difference. First operand 787 states and 970 transitions. Second operand 4 states. [2021-01-07 00:15:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:11,136 INFO L93 Difference]: Finished difference Result 1134 states and 1408 transitions. [2021-01-07 00:15:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:11,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-07 00:15:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:11,139 INFO L225 Difference]: With dead ends: 1134 [2021-01-07 00:15:11,139 INFO L226 Difference]: Without dead ends: 379 [2021-01-07 00:15:11,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-01-07 00:15:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 347. [2021-01-07 00:15:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2021-01-07 00:15:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 404 transitions. [2021-01-07 00:15:11,269 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 404 transitions. Word has length 72 [2021-01-07 00:15:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:11,269 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 404 transitions. [2021-01-07 00:15:11,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 404 transitions. [2021-01-07 00:15:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 00:15:11,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:11,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:11,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 00:15:11,471 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2021-01-07 00:15:11,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:11,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269460453] [2021-01-07 00:15:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:11,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269460453] [2021-01-07 00:15:11,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:11,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:11,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527212425] [2021-01-07 00:15:11,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:11,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:11,626 INFO L87 Difference]: Start difference. First operand 347 states and 404 transitions. Second operand 3 states. [2021-01-07 00:15:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:11,709 INFO L93 Difference]: Finished difference Result 572 states and 666 transitions. [2021-01-07 00:15:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-07 00:15:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:11,712 INFO L225 Difference]: With dead ends: 572 [2021-01-07 00:15:11,712 INFO L226 Difference]: Without dead ends: 270 [2021-01-07 00:15:11,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-01-07 00:15:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-01-07 00:15:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-07 00:15:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2021-01-07 00:15:11,773 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 81 [2021-01-07 00:15:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:11,774 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2021-01-07 00:15:11,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2021-01-07 00:15:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 00:15:11,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:11,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:11,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 00:15:11,775 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2021-01-07 00:15:11,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:11,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922100434] [2021-01-07 00:15:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:12,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922100434] [2021-01-07 00:15:12,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:12,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:12,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227629492] [2021-01-07 00:15:12,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:12,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:12,207 INFO L87 Difference]: Start difference. First operand 270 states and 305 transitions. Second operand 4 states. [2021-01-07 00:15:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:12,346 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2021-01-07 00:15:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:12,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-07 00:15:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:12,348 INFO L225 Difference]: With dead ends: 272 [2021-01-07 00:15:12,349 INFO L226 Difference]: Without dead ends: 222 [2021-01-07 00:15:12,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-01-07 00:15:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2021-01-07 00:15:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-07 00:15:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2021-01-07 00:15:12,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 83 [2021-01-07 00:15:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:12,386 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2021-01-07 00:15:12,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2021-01-07 00:15:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-07 00:15:12,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:12,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:12,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 00:15:12,388 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:15:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2021-01-07 00:15:12,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:12,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792676120] [2021-01-07 00:15:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:12,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792676120] [2021-01-07 00:15:12,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:12,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:12,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582321088] [2021-01-07 00:15:12,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:12,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:12,755 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 5 states. [2021-01-07 00:15:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:12,889 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-01-07 00:15:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:15:12,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2021-01-07 00:15:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:12,889 INFO L225 Difference]: With dead ends: 138 [2021-01-07 00:15:12,890 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 00:15:12,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 00:15:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 00:15:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 00:15:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 00:15:12,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-01-07 00:15:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:12,891 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 00:15:12,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 00:15:12,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 00:15:12,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 00:15:12,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-07 00:15:13,496 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 149 [2021-01-07 00:15:13,936 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 146 [2021-01-07 00:15:14,169 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 127 [2021-01-07 00:15:14,533 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2021-01-07 00:15:15,297 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 150 [2021-01-07 00:15:15,637 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2021-01-07 00:15:16,056 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 152 [2021-01-07 00:15:16,266 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2021-01-07 00:15:16,608 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2021-01-07 00:15:17,070 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 141 [2021-01-07 00:15:17,236 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2021-01-07 00:15:17,550 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 117 [2021-01-07 00:15:17,766 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2021-01-07 00:15:17,941 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2021-01-07 00:15:18,199 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 137 [2021-01-07 00:15:18,394 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2021-01-07 00:15:18,564 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2021-01-07 00:15:19,082 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2021-01-07 00:15:19,783 WARN L197 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 67 [2021-01-07 00:15:20,437 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2021-01-07 00:15:20,957 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2021-01-07 00:15:21,500 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2021-01-07 00:15:21,875 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2021-01-07 00:15:21,997 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2021-01-07 00:15:23,091 WARN L197 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 54 [2021-01-07 00:15:23,274 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2021-01-07 00:15:23,544 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2021-01-07 00:15:23,826 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2021-01-07 00:15:24,718 WARN L197 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 24 [2021-01-07 00:15:25,018 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-07 00:15:25,359 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2021-01-07 00:15:25,702 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2021-01-07 00:15:26,341 WARN L197 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2021-01-07 00:15:26,799 WARN L197 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2021-01-07 00:15:27,641 WARN L197 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 49 [2021-01-07 00:15:28,149 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2021-01-07 00:15:28,717 WARN L197 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2021-01-07 00:15:29,199 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2021-01-07 00:15:29,471 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2021-01-07 00:15:29,696 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2021-01-07 00:15:30,044 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2021-01-07 00:15:30,536 WARN L197 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 23 [2021-01-07 00:15:31,041 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2021-01-07 00:15:31,355 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2021-01-07 00:15:31,460 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-01-07 00:15:32,084 WARN L197 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2021-01-07 00:15:32,165 INFO L185 CegarLoopUtils]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2021-01-07 00:15:32,165 INFO L189 CegarLoopUtils]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2021-01-07 00:15:32,166 INFO L185 CegarLoopUtils]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2021-01-07 00:15:32,166 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,167 INFO L185 CegarLoopUtils]: At program point L3471(lines 3465 3473) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,167 INFO L185 CegarLoopUtils]: At program point L4264-1(lines 1 4266) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2021-01-07 00:15:32,167 INFO L189 CegarLoopUtils]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2021-01-07 00:15:32,167 INFO L189 CegarLoopUtils]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2021-01-07 00:15:32,167 INFO L189 CegarLoopUtils]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-01-07 00:15:32,167 INFO L189 CegarLoopUtils]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-01-07 00:15:32,168 INFO L185 CegarLoopUtils]: At program point L3439-1(lines 3433 3441) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,168 INFO L185 CegarLoopUtils]: At program point L3439(lines 3433 3441) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,168 INFO L185 CegarLoopUtils]: At program point L4233(lines 4008 4011) the Hoare annotation is: (let ((.cse5 (= ~ldv_urb_state~0 0)) (.cse6 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse2 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 .cse2 .cse3 (= 0 ~res_kbtab_probe_3~0) .cse4 (<= ~ldv_urb_state~0 1)) (and (<= (+ ~res_kbtab_probe_3~0 12) 0) (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse5 .cse6 .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse2) (and .cse5 .cse6 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse0 (or (<= 1 ~res_kbtab_probe_3~0) (<= (+ ~res_kbtab_probe_3~0 1) 0)) .cse1 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse2 .cse3 .cse4 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (let ((.cse10 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse9 (div .cse10 18446744073709551616))) (or (< (* 18446744073709551616 .cse9) .cse10) (<= (+ .cse9 1) 0))))))) [2021-01-07 00:15:32,169 INFO L189 CegarLoopUtils]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-01-07 00:15:32,169 INFO L189 CegarLoopUtils]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-01-07 00:15:32,169 INFO L185 CegarLoopUtils]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= 0 ~res_kbtab_probe_3~0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 (or (<= (+ |ULTIMATE.start_kbtab_probe_#res| 1) 0) (<= 1 |ULTIMATE.start_kbtab_probe_#res|)) .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) .cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))) (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 (<= ~ldv_urb_state~0 1)) (and (<= (+ |ULTIMATE.start_kbtab_probe_#res| 12) 0) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4))) [2021-01-07 00:15:32,169 INFO L185 CegarLoopUtils]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,170 INFO L189 CegarLoopUtils]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-01-07 00:15:32,170 INFO L185 CegarLoopUtils]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,170 INFO L189 CegarLoopUtils]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2021-01-07 00:15:32,170 INFO L189 CegarLoopUtils]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2021-01-07 00:15:32,170 INFO L189 CegarLoopUtils]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2021-01-07 00:15:32,170 INFO L189 CegarLoopUtils]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2021-01-07 00:15:32,170 INFO L185 CegarLoopUtils]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,171 INFO L185 CegarLoopUtils]: At program point L3411-1(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,171 INFO L185 CegarLoopUtils]: At program point L3411(lines 3405 3413) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 (= |ULTIMATE.start_kzalloc_#res.base| 0) (= |ULTIMATE.start_kzalloc_#res.offset| 0) (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,171 INFO L185 CegarLoopUtils]: At program point L4204-1(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,171 INFO L185 CegarLoopUtils]: At program point L4204-2(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4))) [2021-01-07 00:15:32,172 INFO L185 CegarLoopUtils]: At program point L4204(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse1 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,172 INFO L185 CegarLoopUtils]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (= ~ldv_coherent_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,172 INFO L185 CegarLoopUtils]: At program point L4204-3(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,172 INFO L185 CegarLoopUtils]: At program point L4204-4(lines 4201 4205) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,172 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,173 INFO L189 CegarLoopUtils]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-01-07 00:15:32,173 INFO L189 CegarLoopUtils]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2021-01-07 00:15:32,176 INFO L189 CegarLoopUtils]: For program point L4073(line 4073) no Hoare annotation was computed. [2021-01-07 00:15:32,176 INFO L189 CegarLoopUtils]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-01-07 00:15:32,176 INFO L185 CegarLoopUtils]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,177 INFO L185 CegarLoopUtils]: At program point L4239(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse5))) [2021-01-07 00:15:32,177 INFO L185 CegarLoopUtils]: At program point L4239-1(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.base| 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,177 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,177 INFO L185 CegarLoopUtils]: At program point L3513(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,177 INFO L185 CegarLoopUtils]: At program point L4207(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,177 INFO L185 CegarLoopUtils]: At program point L4207-1(lines 4206 4208) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse3 .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)))) [2021-01-07 00:15:32,178 INFO L185 CegarLoopUtils]: At program point L4174(lines 4150 4179) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,178 INFO L185 CegarLoopUtils]: At program point L4174-1(lines 4150 4179) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,178 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,178 INFO L185 CegarLoopUtils]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-01-07 00:15:32,178 INFO L189 CegarLoopUtils]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-01-07 00:15:32,178 INFO L189 CegarLoopUtils]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-01-07 00:15:32,178 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,178 INFO L185 CegarLoopUtils]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,178 INFO L189 CegarLoopUtils]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L185 CegarLoopUtils]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-01-07 00:15:32,179 INFO L185 CegarLoopUtils]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse13 (= 0 ~res_kbtab_probe_3~0)) (.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse6 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse8 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_usb_alloc_urb_#res.offset| 0)) (.cse10 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse13 (let ((.cse15 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse14 (div .cse15 18446744073709551616))) (or (< (* 18446744073709551616 .cse14) .cse15) (<= (+ .cse14 1) 0))))) (and (not .cse0) (<= 1 ~ldv_urb_state~0) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse10 .cse13 (<= ~ldv_urb_state~0 1)) (and .cse0 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse8 .cse2 .cse9 .cse10))) [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-01-07 00:15:32,179 INFO L189 CegarLoopUtils]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-01-07 00:15:32,180 INFO L185 CegarLoopUtils]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,180 INFO L185 CegarLoopUtils]: At program point L4214(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,180 INFO L185 CegarLoopUtils]: At program point L4214-1(lines 4213 4215) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,180 INFO L185 CegarLoopUtils]: At program point L4214-2(lines 4213 4215) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,180 INFO L189 CegarLoopUtils]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,180 INFO L189 CegarLoopUtils]: For program point L4049(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,180 INFO L189 CegarLoopUtils]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,180 INFO L189 CegarLoopUtils]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,180 INFO L189 CegarLoopUtils]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L185 CegarLoopUtils]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-01-07 00:15:32,181 INFO L185 CegarLoopUtils]: At program point L4117-1(lines 4093 4122) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (< (* 18446744073709551616 .cse2) .cse3) (<= (+ .cse2 1) 0))))) [2021-01-07 00:15:32,181 INFO L185 CegarLoopUtils]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse9 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0)))))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse8 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse7 (div .cse8 18446744073709551616))) (or (<= (+ .cse7 1) 0) (< (* 18446744073709551616 .cse7) .cse8)))) (= 0 ~res_kbtab_probe_3~0) .cse9) (and .cse0 .cse2 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse6 .cse9))) [2021-01-07 00:15:32,181 INFO L189 CegarLoopUtils]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L185 CegarLoopUtils]: At program point L4250(lines 4184 4189) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0)) [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L189 CegarLoopUtils]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-01-07 00:15:32,182 INFO L185 CegarLoopUtils]: At program point L3922(lines 3911 3924) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1) (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,183 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse3 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse2 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) .cse3 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse5 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) (= 0 ~res_kbtab_probe_3~0) (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (< (* 18446744073709551616 .cse6) .cse7) (<= (+ .cse6 1) 0))))) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse3))) [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L4154-2loopEntry(lines 4154 4173) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L3923(lines 3909 3925) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)) (and (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) (or (< 0 ULTIMATE.start_kbtab_init_~retval~1) (<= (+ ULTIMATE.start_kbtab_init_~retval~1 1) 0)) .cse0 .cse1))) [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,183 INFO L185 CegarLoopUtils]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,184 INFO L189 CegarLoopUtils]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2021-01-07 00:15:32,184 INFO L189 CegarLoopUtils]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-01-07 00:15:32,184 INFO L185 CegarLoopUtils]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (= |ULTIMATE.start_usb_alloc_coherent_#res.offset| 0)) (.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (= ~ldv_coherent_state~0 0)) (.cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse5 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse6 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0))) (or (and .cse0 (<= ~ldv_coherent_state~0 1) .cse1 (<= 1 ~ldv_coherent_state~0) .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse3 .cse6 (let ((.cse12 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (<= (+ .cse11 1) 0) (< (* 18446744073709551616 .cse11) .cse12)))) .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.base 0) .cse4 .cse5 .cse6 .cse3))) [2021-01-07 00:15:32,184 INFO L189 CegarLoopUtils]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-01-07 00:15:32,184 INFO L189 CegarLoopUtils]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2021-01-07 00:15:32,184 INFO L185 CegarLoopUtils]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,184 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-07 00:15:32,184 INFO L192 CegarLoopUtils]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2021-01-07 00:15:32,185 INFO L192 CegarLoopUtils]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2021-01-07 00:15:32,185 INFO L192 CegarLoopUtils]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2021-01-07 00:15:32,185 INFO L192 CegarLoopUtils]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2021-01-07 00:15:32,185 INFO L185 CegarLoopUtils]: At program point L4257(lines 4256 4258) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,185 INFO L185 CegarLoopUtils]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,185 INFO L185 CegarLoopUtils]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,185 INFO L189 CegarLoopUtils]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse1 (<= 1 ~ldv_urb_state~0)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse3 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse9 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse5 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse8 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~ldv_urb_state~0 1)) (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse11 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse10 (div .cse11 18446744073709551616))) (or (< (* 18446744073709551616 .cse10) .cse11) (<= (+ .cse10 1) 0))))))) [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L3401-1(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_kbtab_probe_~kbtab~3.base 0) .cse4 (= ULTIMATE.start_kbtab_probe_~kbtab~3.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)))) [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L3401(lines 3394 3403) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse2 (= ~ldv_coherent_state~0 0)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0)) (and (= |ULTIMATE.start_kmalloc_#res.base| 0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) .cse0 (= |ULTIMATE.start_ldv_malloc_#res.base| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start___kmalloc_#res.offset| 0) .cse4 (= |ULTIMATE.start___kmalloc_#res.base| 0)))) [2021-01-07 00:15:32,186 INFO L185 CegarLoopUtils]: At program point L4227(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,187 INFO L185 CegarLoopUtils]: At program point L4227-1(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,187 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-07 00:15:32,187 INFO L185 CegarLoopUtils]: At program point L4227-2(lines 4226 4228) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,187 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-01-07 00:15:32,187 INFO L185 CegarLoopUtils]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,187 INFO L189 CegarLoopUtils]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-01-07 00:15:32,187 INFO L189 CegarLoopUtils]: For program point L4130(line 4130) no Hoare annotation was computed. [2021-01-07 00:15:32,187 INFO L189 CegarLoopUtils]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-01-07 00:15:32,188 INFO L185 CegarLoopUtils]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse5 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (.cse6 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse7 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0))) (or (and .cse0 (or (< 0 ULTIMATE.start_kbtab_probe_~error~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 1) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse8 (div .cse9 18446744073709551616))) (or (<= (+ .cse8 1) 0) (< (* 18446744073709551616 .cse8) .cse9)))) (= 0 ~res_kbtab_probe_3~0)) (and .cse0 .cse2 .cse3 .cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse4 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.base 0) .cse5 .cse6 .cse7))) [2021-01-07 00:15:32,188 INFO L189 CegarLoopUtils]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2021-01-07 00:15:32,188 INFO L185 CegarLoopUtils]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_kbtab_probe_#res| 0)) (.cse3 (<= 1 ~ldv_urb_state~0)) (.cse4 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= |ULTIMATE.start_ldv_malloc_#res.offset| 0)) (.cse10 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse6 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0)) (.cse0 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse8 (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0)) (.cse9 (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 0) .cse0 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0) .cse1) (and .cse2 .cse3 (<= ~ldv_coherent_state~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~ldv_urb_state~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1) (and .cse5 .cse10 .cse6 .cse7 .cse0 .cse8 .cse9 .cse1 (let ((.cse12 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse11 (div .cse12 18446744073709551616))) (or (< (* 18446744073709551616 .cse11) .cse12) (<= (+ .cse11 1) 0))))))) [2021-01-07 00:15:32,188 INFO L185 CegarLoopUtils]: At program point L4097-2loopEntry(lines 4097 4116) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.offset ULTIMATE.start_usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (< (* 18446744073709551616 .cse0) .cse1)))) (= 0 ~res_kbtab_probe_3~0)) [2021-01-07 00:15:32,188 INFO L185 CegarLoopUtils]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_kbtab_probe_#res| 0) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= |ULTIMATE.start_ldv_malloc_#res.offset| 0) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1.offset 0) (= ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0.offset 0) (= |ULTIMATE.start_ldv_undefined_pointer_#res.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 1)) [2021-01-07 00:15:32,188 INFO L189 CegarLoopUtils]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-01-07 00:15:32,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 12:15:32 BoogieIcfgContainer [2021-01-07 00:15:32,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 00:15:32,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 00:15:32,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 00:15:32,271 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 00:15:32,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:00" (3/4) ... [2021-01-07 00:15:32,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 00:15:32,302 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2021-01-07 00:15:32,304 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2021-01-07 00:15:32,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-01-07 00:15:32,311 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-01-07 00:15:32,313 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-07 00:15:32,352 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) [2021-01-07 00:15:32,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2021-01-07 00:15:32,353 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2021-01-07 00:15:32,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2021-01-07 00:15:32,354 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2021-01-07 00:15:32,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2021-01-07 00:15:32,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2021-01-07 00:15:32,357 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2021-01-07 00:15:32,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) [2021-01-07 00:15:32,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) [2021-01-07 00:15:32,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 [2021-01-07 00:15:32,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-01-07 00:15:32,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2021-01-07 00:15:32,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2021-01-07 00:15:32,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-01-07 00:15:32,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) [2021-01-07 00:15:32,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) [2021-01-07 00:15:32,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2021-01-07 00:15:32,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 [2021-01-07 00:15:32,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 [2021-01-07 00:15:32,666 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i-witness.graphml [2021-01-07 00:15:32,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 00:15:32,667 INFO L168 Benchmark]: Toolchain (without parser) took 36409.67 ms. Allocated memory was 163.6 MB in the beginning and 629.1 MB in the end (delta: 465.6 MB). Free memory was 132.6 MB in the beginning and 508.6 MB in the end (delta: -376.0 MB). Peak memory consumption was 89.7 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,668 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 163.6 MB. Free memory is still 136.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 00:15:32,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1789.06 ms. Allocated memory is still 163.6 MB. Free memory was 132.4 MB in the beginning and 90.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.91 ms. Allocated memory is still 163.6 MB. Free memory was 90.8 MB in the beginning and 84.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,669 INFO L168 Benchmark]: Boogie Preprocessor took 136.13 ms. Allocated memory is still 163.6 MB. Free memory was 84.5 MB in the beginning and 78.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,669 INFO L168 Benchmark]: RCFGBuilder took 2125.44 ms. Allocated memory was 163.6 MB in the beginning and 200.3 MB in the end (delta: 36.7 MB). Free memory was 78.7 MB in the beginning and 102.2 MB in the end (delta: -23.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,670 INFO L168 Benchmark]: TraceAbstraction took 31826.25 ms. Allocated memory was 200.3 MB in the beginning and 629.1 MB in the end (delta: 428.9 MB). Free memory was 101.7 MB in the beginning and 572.5 MB in the end (delta: -470.8 MB). Peak memory consumption was 323.0 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,670 INFO L168 Benchmark]: Witness Printer took 395.20 ms. Allocated memory is still 629.1 MB. Free memory was 572.5 MB in the beginning and 508.6 MB in the end (delta: 63.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. [2021-01-07 00:15:32,673 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.25 ms. Allocated memory is still 163.6 MB. Free memory is still 136.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1789.06 ms. Allocated memory is still 163.6 MB. Free memory was 132.4 MB in the beginning and 90.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 42.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 124.91 ms. Allocated memory is still 163.6 MB. Free memory was 90.8 MB in the beginning and 84.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 136.13 ms. Allocated memory is still 163.6 MB. Free memory was 84.5 MB in the beginning and 78.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2125.44 ms. Allocated memory was 163.6 MB in the beginning and 200.3 MB in the end (delta: 36.7 MB). Free memory was 78.7 MB in the beginning and 102.2 MB in the end (delta: -23.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31826.25 ms. Allocated memory was 200.3 MB in the beginning and 629.1 MB in the end (delta: 428.9 MB). Free memory was 101.7 MB in the beginning and 572.5 MB in the end (delta: -470.8 MB). Peak memory consumption was 323.0 MB. Max. memory is 8.0 GB. * Witness Printer took 395.20 ms. Allocated memory is still 629.1 MB. Free memory was 572.5 MB in the beginning and 508.6 MB in the end (delta: 63.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || (((((\result + 12 <= 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && error + 12 <= 0) && !(\result == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0)) || (((((((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && ldv_urb_state == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) || ((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1)) || ((((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || ((((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4238]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && 0 == res_kbtab_probe_3) || (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && kbtab == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: (((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) || (((((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && (0 < error || error + 1 <= 0)) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4213]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: ((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: (((0 < retval || retval + 1 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) || ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4008]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || ((((((res_kbtab_probe_3 + 12 <= 0 && \result + 12 <= 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && (1 <= res_kbtab_probe_3 || res_kbtab_probe_3 + 1 <= 0)) && arbitrary_memory == 0) && (\result + 1 <= 0 || 1 <= \result)) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && \result == 0) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) || (((((((ldv_urb_state == 0 && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3433]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && \result == 0) && ldv_urb_state <= 1) || (((ldv_urb_state == 0 && ldv_coherent_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3)) || (((((((((\result == 0 && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && \result == 0) && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3)) || (((((((\result == 0 && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && (0 < error || error + 1 <= 0)) && \result == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || ((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 && ldv_coherent_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) || (((((ldv_urb_state == 0 && \result == 0) && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: (((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4201]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && ldv_coherent_state == 0) && \result == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((((((1 <= ldv_urb_state && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && kbtab == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: ((((((((((((((\result == 0 && \result == 0) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || (((((((((((!(\result == 0) && 1 <= ldv_urb_state) && \result == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && error + 12 <= 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1)) || (((((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && error + 12 <= 0) && arbitrary_memory == 0) && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && arbitrary_memory == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) && 0 == res_kbtab_probe_3) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0) - InvariantResult [Line: 3909]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 0 && ldv_coherent_state == 0) && 0 == res_kbtab_probe_3) || ((((1 <= \result || \result + 1 <= 0) && (0 < retval || retval + 1 <= 0)) && ldv_urb_state == 0) && ldv_coherent_state == 0) - InvariantResult [Line: 3405]: Loop Invariant Derived loop invariant: (((((((((((\result == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 0) && \result == 0) && \result == 0) && error + 12 <= 0) && \result == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || (((((ldv_urb_state == 0 && \result == 0) && ldv_coherent_state == 0) && error + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4058]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && 1 <= ldv_urb_state) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && \result == 0) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.3s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4273 SDtfs, 5417 SDslu, 7619 SDs, 0 SdLazy, 721 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 7542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 222 NumberOfFragments, 3416 HoareAnnotationTreeSize, 68 FomulaSimplifications, 61795123 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 402356 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 170506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...