/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-dcfa08f [2020-12-23 14:19:37,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:19:37,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:19:37,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:19:37,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:19:37,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:19:37,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:19:37,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:19:37,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:19:37,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:19:37,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:19:37,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:19:37,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:19:37,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:19:37,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:19:37,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:19:37,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:19:37,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:19:37,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:19:37,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:19:37,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:19:37,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:19:37,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:19:37,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:19:37,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:19:37,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:19:37,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:19:37,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:19:37,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:19:37,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:19:37,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:19:37,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:19:37,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:19:37,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:19:37,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:19:37,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:19:37,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:19:37,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:19:37,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:19:37,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:19:37,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:19:37,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:19:37,362 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:19:37,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:19:37,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:19:37,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:19:37,367 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:19:37,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:19:37,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:19:37,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:19:37,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:19:37,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:19:37,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:19:37,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:19:37,369 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:19:37,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:19:37,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:19:37,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:19:37,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:19:37,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:19:37,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:19:37,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:19:37,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:19:37,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:19:37,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:19:37,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:19:37,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:19:37,372 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 [2020-12-23 14:19:37,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:19:37,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:19:37,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:19:37,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:19:37,772 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:19:37,773 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 [2020-12-23 14:19:37,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cd07da80a/27ae4031786a424ca7f88d659e07d7d0/FLAG12349363a [2020-12-23 14:19:38,775 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:19:38,776 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 [2020-12-23 14:19:38,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cd07da80a/27ae4031786a424ca7f88d659e07d7d0/FLAG12349363a [2020-12-23 14:19:38,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cd07da80a/27ae4031786a424ca7f88d659e07d7d0 [2020-12-23 14:19:38,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:19:38,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:19:38,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:19:38,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:19:38,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:19:38,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:19:38" (1/1) ... [2020-12-23 14:19:38,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1953a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:38, skipping insertion in model container [2020-12-23 14:19:38,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:19:38" (1/1) ... [2020-12-23 14:19:38,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:19:38,934 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,] [2020-12-23 14:19:39,748 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] [2020-12-23 14:19:39,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:19:39,825 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,] [2020-12-23 14:19:40,034 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] [2020-12-23 14:19:40,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:19:40,133 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:19:40,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40 WrapperNode [2020-12-23 14:19:40,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:19:40,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:19:40,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:19:40,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:19:40,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:19:40,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:19:40,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:19:40,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:19:40,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (1/1) ... [2020-12-23 14:19:40,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:19:40,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:19:40,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:19:40,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:19:40,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (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 [2020-12-23 14:19:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:19:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:19:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:19:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:19:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:19:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:19:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:19:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:19:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:19:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:19:40,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:19:41,004 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 14:19:42,058 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2020-12-23 14:19:42,058 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2020-12-23 14:19:42,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:19:42,072 INFO L299 CfgBuilder]: Removed 135 assume(true) statements. [2020-12-23 14:19:42,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:19:42 BoogieIcfgContainer [2020-12-23 14:19:42,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:19:42,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:19:42,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:19:42,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:19:42,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:19:38" (1/3) ... [2020-12-23 14:19:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:19:42, skipping insertion in model container [2020-12-23 14:19:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:19:40" (2/3) ... [2020-12-23 14:19:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942cb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:19:42, skipping insertion in model container [2020-12-23 14:19:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:19:42" (3/3) ... [2020-12-23 14:19:42,085 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2020-12-23 14:19:42,092 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:19:42,097 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 14:19:42,116 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 14:19:42,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:19:42,148 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:19:42,148 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:19:42,148 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:19:42,148 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:19:42,148 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:19:42,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:19:42,149 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:19:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2020-12-23 14:19:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 14:19:42,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:42,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:19:42,173 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]=== [2020-12-23 14:19:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1802508012, now seen corresponding path program 1 times [2020-12-23 14:19:42,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:42,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685907717] [2020-12-23 14:19:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:42,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685907717] [2020-12-23 14:19:42,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:42,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:19:42,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59849603] [2020-12-23 14:19:42,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:19:42,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:19:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:19:42,668 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-12-23 14:19:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:42,790 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2020-12-23 14:19:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:19:42,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-23 14:19:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:42,806 INFO L225 Difference]: With dead ends: 360 [2020-12-23 14:19:42,806 INFO L226 Difference]: Without dead ends: 226 [2020-12-23 14:19:42,810 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 [2020-12-23 14:19:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-12-23 14:19:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2020-12-23 14:19:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-23 14:19:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2020-12-23 14:19:42,871 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 11 [2020-12-23 14:19:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:42,871 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2020-12-23 14:19:42,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:19:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2020-12-23 14:19:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 14:19:42,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:42,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:19:42,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:19:42,873 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]=== [2020-12-23 14:19:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 43172304, now seen corresponding path program 1 times [2020-12-23 14:19:42,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:42,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032355374] [2020-12-23 14:19:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:43,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032355374] [2020-12-23 14:19:43,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:43,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:19:43,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641677560] [2020-12-23 14:19:43,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:19:43,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:19:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:19:43,055 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand 3 states. [2020-12-23 14:19:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:43,127 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2020-12-23 14:19:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:19:43,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-23 14:19:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:43,134 INFO L225 Difference]: With dead ends: 630 [2020-12-23 14:19:43,134 INFO L226 Difference]: Without dead ends: 418 [2020-12-23 14:19:43,136 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 [2020-12-23 14:19:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-12-23 14:19:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 404. [2020-12-23 14:19:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-12-23 14:19:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 510 transitions. [2020-12-23 14:19:43,209 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 510 transitions. Word has length 12 [2020-12-23 14:19:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:43,210 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 510 transitions. [2020-12-23 14:19:43,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:19:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 510 transitions. [2020-12-23 14:19:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 14:19:43,214 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:43,215 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] [2020-12-23 14:19:43,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:19:43,215 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]=== [2020-12-23 14:19:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash -803172382, now seen corresponding path program 1 times [2020-12-23 14:19:43,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:43,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066846967] [2020-12-23 14:19:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:43,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066846967] [2020-12-23 14:19:43,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:43,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:43,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240125349] [2020-12-23 14:19:43,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:43,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:43,444 INFO L87 Difference]: Start difference. First operand 404 states and 510 transitions. Second operand 5 states. [2020-12-23 14:19:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:43,633 INFO L93 Difference]: Finished difference Result 922 states and 1192 transitions. [2020-12-23 14:19:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:19:43,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-23 14:19:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:43,645 INFO L225 Difference]: With dead ends: 922 [2020-12-23 14:19:43,646 INFO L226 Difference]: Without dead ends: 525 [2020-12-23 14:19:43,653 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 [2020-12-23 14:19:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-12-23 14:19:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 475. [2020-12-23 14:19:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2020-12-23 14:19:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 611 transitions. [2020-12-23 14:19:43,725 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 611 transitions. Word has length 28 [2020-12-23 14:19:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:43,725 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 611 transitions. [2020-12-23 14:19:43,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 611 transitions. [2020-12-23 14:19:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 14:19:43,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:43,729 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] [2020-12-23 14:19:43,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:19:43,730 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]=== [2020-12-23 14:19:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 225824829, now seen corresponding path program 1 times [2020-12-23 14:19:43,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:43,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184119859] [2020-12-23 14:19:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:43,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184119859] [2020-12-23 14:19:43,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:43,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:19:43,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796156665] [2020-12-23 14:19:43,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:19:43,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:19:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:19:43,944 INFO L87 Difference]: Start difference. First operand 475 states and 611 transitions. Second operand 7 states. [2020-12-23 14:19:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:44,805 INFO L93 Difference]: Finished difference Result 2911 states and 3713 transitions. [2020-12-23 14:19:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:19:44,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-23 14:19:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:44,820 INFO L225 Difference]: With dead ends: 2911 [2020-12-23 14:19:44,820 INFO L226 Difference]: Without dead ends: 2445 [2020-12-23 14:19:44,823 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 [2020-12-23 14:19:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2020-12-23 14:19:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 519. [2020-12-23 14:19:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-12-23 14:19:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 659 transitions. [2020-12-23 14:19:44,904 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 659 transitions. Word has length 46 [2020-12-23 14:19:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:44,905 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 659 transitions. [2020-12-23 14:19:44,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:19:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 659 transitions. [2020-12-23 14:19:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 14:19:44,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:44,914 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] [2020-12-23 14:19:44,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 14:19:44,914 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]=== [2020-12-23 14:19:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:44,915 INFO L82 PathProgramCache]: Analyzing trace with hash 248457083, now seen corresponding path program 1 times [2020-12-23 14:19:44,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:44,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189672621] [2020-12-23 14:19:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:45,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189672621] [2020-12-23 14:19:45,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:45,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:45,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552890198] [2020-12-23 14:19:45,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:45,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:45,085 INFO L87 Difference]: Start difference. First operand 519 states and 659 transitions. Second operand 5 states. [2020-12-23 14:19:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:45,569 INFO L93 Difference]: Finished difference Result 2758 states and 3486 transitions. [2020-12-23 14:19:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:19:45,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-12-23 14:19:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:45,584 INFO L225 Difference]: With dead ends: 2758 [2020-12-23 14:19:45,584 INFO L226 Difference]: Without dead ends: 2491 [2020-12-23 14:19:45,586 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 [2020-12-23 14:19:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2020-12-23 14:19:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 531. [2020-12-23 14:19:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-12-23 14:19:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2020-12-23 14:19:45,704 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 46 [2020-12-23 14:19:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:45,704 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2020-12-23 14:19:45,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2020-12-23 14:19:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 14:19:45,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:45,709 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] [2020-12-23 14:19:45,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 14:19:45,709 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]=== [2020-12-23 14:19:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1031406595, now seen corresponding path program 1 times [2020-12-23 14:19:45,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:45,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872917369] [2020-12-23 14:19:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:45,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872917369] [2020-12-23 14:19:45,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:45,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:19:45,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337219253] [2020-12-23 14:19:45,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:19:45,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:19:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:19:45,885 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand 7 states. [2020-12-23 14:19:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:46,227 INFO L93 Difference]: Finished difference Result 1148 states and 1445 transitions. [2020-12-23 14:19:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:19:46,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-23 14:19:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:46,233 INFO L225 Difference]: With dead ends: 1148 [2020-12-23 14:19:46,233 INFO L226 Difference]: Without dead ends: 875 [2020-12-23 14:19:46,234 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 [2020-12-23 14:19:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-12-23 14:19:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 535. [2020-12-23 14:19:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-12-23 14:19:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 675 transitions. [2020-12-23 14:19:46,304 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 675 transitions. Word has length 46 [2020-12-23 14:19:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:46,305 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 675 transitions. [2020-12-23 14:19:46,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:19:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 675 transitions. [2020-12-23 14:19:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 14:19:46,306 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:46,306 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] [2020-12-23 14:19:46,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 14:19:46,306 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]=== [2020-12-23 14:19:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2143426174, now seen corresponding path program 1 times [2020-12-23 14:19:46,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:46,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904432919] [2020-12-23 14:19:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:46,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904432919] [2020-12-23 14:19:46,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:46,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:46,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591149883] [2020-12-23 14:19:46,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:46,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:46,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:46,430 INFO L87 Difference]: Start difference. First operand 535 states and 675 transitions. Second operand 5 states. [2020-12-23 14:19:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:46,911 INFO L93 Difference]: Finished difference Result 2870 states and 3617 transitions. [2020-12-23 14:19:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:19:46,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-12-23 14:19:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:46,924 INFO L225 Difference]: With dead ends: 2870 [2020-12-23 14:19:46,924 INFO L226 Difference]: Without dead ends: 2595 [2020-12-23 14:19:46,926 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 [2020-12-23 14:19:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2020-12-23 14:19:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 547. [2020-12-23 14:19:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-12-23 14:19:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 687 transitions. [2020-12-23 14:19:47,021 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 687 transitions. Word has length 51 [2020-12-23 14:19:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:47,021 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 687 transitions. [2020-12-23 14:19:47,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 687 transitions. [2020-12-23 14:19:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 14:19:47,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:47,024 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] [2020-12-23 14:19:47,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 14:19:47,025 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]=== [2020-12-23 14:19:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1471482752, now seen corresponding path program 1 times [2020-12-23 14:19:47,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:47,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23879515] [2020-12-23 14:19:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:47,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23879515] [2020-12-23 14:19:47,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:47,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:19:47,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274919756] [2020-12-23 14:19:47,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:47,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:47,207 INFO L87 Difference]: Start difference. First operand 547 states and 687 transitions. Second operand 4 states. [2020-12-23 14:19:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:47,338 INFO L93 Difference]: Finished difference Result 1153 states and 1451 transitions. [2020-12-23 14:19:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:47,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 14:19:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:47,344 INFO L225 Difference]: With dead ends: 1153 [2020-12-23 14:19:47,344 INFO L226 Difference]: Without dead ends: 615 [2020-12-23 14:19:47,346 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 [2020-12-23 14:19:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-12-23 14:19:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 376. [2020-12-23 14:19:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-12-23 14:19:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 467 transitions. [2020-12-23 14:19:47,443 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 467 transitions. Word has length 51 [2020-12-23 14:19:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:47,443 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 467 transitions. [2020-12-23 14:19:47,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 467 transitions. [2020-12-23 14:19:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 14:19:47,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:47,444 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] [2020-12-23 14:19:47,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 14:19:47,445 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]=== [2020-12-23 14:19:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -934513600, now seen corresponding path program 1 times [2020-12-23 14:19:47,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:47,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952585245] [2020-12-23 14:19:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:47,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952585245] [2020-12-23 14:19:47,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:47,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:47,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87529405] [2020-12-23 14:19:47,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:47,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:47,615 INFO L87 Difference]: Start difference. First operand 376 states and 467 transitions. Second operand 4 states. [2020-12-23 14:19:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:47,826 INFO L93 Difference]: Finished difference Result 660 states and 818 transitions. [2020-12-23 14:19:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:47,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 14:19:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:47,830 INFO L225 Difference]: With dead ends: 660 [2020-12-23 14:19:47,831 INFO L226 Difference]: Without dead ends: 656 [2020-12-23 14:19:47,831 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 [2020-12-23 14:19:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-12-23 14:19:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 634. [2020-12-23 14:19:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-12-23 14:19:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 795 transitions. [2020-12-23 14:19:47,939 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 795 transitions. Word has length 51 [2020-12-23 14:19:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:47,941 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 795 transitions. [2020-12-23 14:19:47,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 795 transitions. [2020-12-23 14:19:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:19:47,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:47,942 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] [2020-12-23 14:19:47,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 14:19:47,942 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]=== [2020-12-23 14:19:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:47,943 INFO L82 PathProgramCache]: Analyzing trace with hash 259265857, now seen corresponding path program 1 times [2020-12-23 14:19:47,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:47,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867773847] [2020-12-23 14:19:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:48,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867773847] [2020-12-23 14:19:48,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:48,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:48,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365089627] [2020-12-23 14:19:48,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:48,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:48,078 INFO L87 Difference]: Start difference. First operand 634 states and 795 transitions. Second operand 5 states. [2020-12-23 14:19:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:48,322 INFO L93 Difference]: Finished difference Result 1281 states and 1598 transitions. [2020-12-23 14:19:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:19:48,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-12-23 14:19:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:48,327 INFO L225 Difference]: With dead ends: 1281 [2020-12-23 14:19:48,327 INFO L226 Difference]: Without dead ends: 635 [2020-12-23 14:19:48,329 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 [2020-12-23 14:19:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-23 14:19:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 580. [2020-12-23 14:19:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-12-23 14:19:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 727 transitions. [2020-12-23 14:19:48,433 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 727 transitions. Word has length 52 [2020-12-23 14:19:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:48,434 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 727 transitions. [2020-12-23 14:19:48,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 727 transitions. [2020-12-23 14:19:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 14:19:48,435 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:48,435 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] [2020-12-23 14:19:48,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 14:19:48,435 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]=== [2020-12-23 14:19:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -489258623, now seen corresponding path program 1 times [2020-12-23 14:19:48,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:48,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741817753] [2020-12-23 14:19:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:48,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741817753] [2020-12-23 14:19:48,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:48,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:19:48,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824555600] [2020-12-23 14:19:48,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:19:48,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:19:48,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:19:48,548 INFO L87 Difference]: Start difference. First operand 580 states and 727 transitions. Second operand 7 states. [2020-12-23 14:19:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:48,845 INFO L93 Difference]: Finished difference Result 859 states and 1071 transitions. [2020-12-23 14:19:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:19:48,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-12-23 14:19:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:48,850 INFO L225 Difference]: With dead ends: 859 [2020-12-23 14:19:48,850 INFO L226 Difference]: Without dead ends: 833 [2020-12-23 14:19:48,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-12-23 14:19:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-12-23 14:19:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 584. [2020-12-23 14:19:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-12-23 14:19:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 731 transitions. [2020-12-23 14:19:48,965 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 731 transitions. Word has length 58 [2020-12-23 14:19:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:48,966 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 731 transitions. [2020-12-23 14:19:48,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:19:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 731 transitions. [2020-12-23 14:19:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 14:19:48,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:48,967 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] [2020-12-23 14:19:48,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 14:19:48,967 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]=== [2020-12-23 14:19:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash 123879707, now seen corresponding path program 1 times [2020-12-23 14:19:48,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:48,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83389470] [2020-12-23 14:19:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:49,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83389470] [2020-12-23 14:19:49,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:49,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:49,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148364860] [2020-12-23 14:19:49,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:19:49,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:19:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:19:49,100 INFO L87 Difference]: Start difference. First operand 584 states and 731 transitions. Second operand 3 states. [2020-12-23 14:19:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:49,236 INFO L93 Difference]: Finished difference Result 1160 states and 1443 transitions. [2020-12-23 14:19:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:19:49,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-23 14:19:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:49,240 INFO L225 Difference]: With dead ends: 1160 [2020-12-23 14:19:49,241 INFO L226 Difference]: Without dead ends: 613 [2020-12-23 14:19:49,242 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 [2020-12-23 14:19:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-12-23 14:19:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 556. [2020-12-23 14:19:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2020-12-23 14:19:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 685 transitions. [2020-12-23 14:19:49,352 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 685 transitions. Word has length 59 [2020-12-23 14:19:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:49,352 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 685 transitions. [2020-12-23 14:19:49,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:19:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 685 transitions. [2020-12-23 14:19:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 14:19:49,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:49,354 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] [2020-12-23 14:19:49,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 14:19:49,354 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]=== [2020-12-23 14:19:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2029608918, now seen corresponding path program 1 times [2020-12-23 14:19:49,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:49,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094992445] [2020-12-23 14:19:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:49,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094992445] [2020-12-23 14:19:49,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:49,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:49,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276031919] [2020-12-23 14:19:49,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:49,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:49,523 INFO L87 Difference]: Start difference. First operand 556 states and 685 transitions. Second operand 5 states. [2020-12-23 14:19:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:49,709 INFO L93 Difference]: Finished difference Result 1106 states and 1363 transitions. [2020-12-23 14:19:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:19:49,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 14:19:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:49,713 INFO L225 Difference]: With dead ends: 1106 [2020-12-23 14:19:49,713 INFO L226 Difference]: Without dead ends: 556 [2020-12-23 14:19:49,714 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 [2020-12-23 14:19:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-12-23 14:19:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2020-12-23 14:19:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2020-12-23 14:19:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 684 transitions. [2020-12-23 14:19:49,814 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 684 transitions. Word has length 61 [2020-12-23 14:19:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:49,815 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 684 transitions. [2020-12-23 14:19:49,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 684 transitions. [2020-12-23 14:19:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 14:19:49,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:49,816 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] [2020-12-23 14:19:49,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 14:19:49,816 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]=== [2020-12-23 14:19:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2070283668, now seen corresponding path program 1 times [2020-12-23 14:19:49,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:49,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077137927] [2020-12-23 14:19:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:49,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077137927] [2020-12-23 14:19:49,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:49,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:49,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946107469] [2020-12-23 14:19:49,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:49,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:49,983 INFO L87 Difference]: Start difference. First operand 556 states and 684 transitions. Second operand 4 states. [2020-12-23 14:19:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:50,288 INFO L93 Difference]: Finished difference Result 1528 states and 1890 transitions. [2020-12-23 14:19:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:50,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 14:19:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:50,294 INFO L225 Difference]: With dead ends: 1528 [2020-12-23 14:19:50,294 INFO L226 Difference]: Without dead ends: 1182 [2020-12-23 14:19:50,296 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 [2020-12-23 14:19:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-12-23 14:19:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 943. [2020-12-23 14:19:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2020-12-23 14:19:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1169 transitions. [2020-12-23 14:19:50,516 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1169 transitions. Word has length 61 [2020-12-23 14:19:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:50,516 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 1169 transitions. [2020-12-23 14:19:50,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1169 transitions. [2020-12-23 14:19:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 14:19:50,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:50,517 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] [2020-12-23 14:19:50,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 14:19:50,518 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]=== [2020-12-23 14:19:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1960369742, now seen corresponding path program 1 times [2020-12-23 14:19:50,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:50,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370627083] [2020-12-23 14:19:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:50,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370627083] [2020-12-23 14:19:50,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:50,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:19:50,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495304231] [2020-12-23 14:19:50,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:50,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:50,637 INFO L87 Difference]: Start difference. First operand 943 states and 1169 transitions. Second operand 4 states. [2020-12-23 14:19:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:50,785 INFO L93 Difference]: Finished difference Result 1413 states and 1743 transitions. [2020-12-23 14:19:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:50,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 14:19:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:50,790 INFO L225 Difference]: With dead ends: 1413 [2020-12-23 14:19:50,790 INFO L226 Difference]: Without dead ends: 547 [2020-12-23 14:19:50,795 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 [2020-12-23 14:19:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-12-23 14:19:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 526. [2020-12-23 14:19:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2020-12-23 14:19:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 643 transitions. [2020-12-23 14:19:50,910 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 643 transitions. Word has length 67 [2020-12-23 14:19:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:50,911 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 643 transitions. [2020-12-23 14:19:50,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 643 transitions. [2020-12-23 14:19:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 14:19:50,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:50,912 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] [2020-12-23 14:19:50,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 14:19:50,913 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]=== [2020-12-23 14:19:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1965673074, now seen corresponding path program 1 times [2020-12-23 14:19:50,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:50,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603505370] [2020-12-23 14:19:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:51,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603505370] [2020-12-23 14:19:51,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:51,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:51,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81832388] [2020-12-23 14:19:51,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:51,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:51,132 INFO L87 Difference]: Start difference. First operand 526 states and 643 transitions. Second operand 4 states. [2020-12-23 14:19:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:51,416 INFO L93 Difference]: Finished difference Result 873 states and 1064 transitions. [2020-12-23 14:19:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:51,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 14:19:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:51,421 INFO L225 Difference]: With dead ends: 873 [2020-12-23 14:19:51,421 INFO L226 Difference]: Without dead ends: 866 [2020-12-23 14:19:51,422 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 [2020-12-23 14:19:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-12-23 14:19:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 783. [2020-12-23 14:19:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-12-23 14:19:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 970 transitions. [2020-12-23 14:19:51,564 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 970 transitions. Word has length 67 [2020-12-23 14:19:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:51,565 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 970 transitions. [2020-12-23 14:19:51,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 970 transitions. [2020-12-23 14:19:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 14:19:51,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:51,566 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] [2020-12-23 14:19:51,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 14:19:51,566 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]=== [2020-12-23 14:19:51,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:51,567 INFO L82 PathProgramCache]: Analyzing trace with hash 495831049, now seen corresponding path program 1 times [2020-12-23 14:19:51,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:51,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171171790] [2020-12-23 14:19:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:51,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171171790] [2020-12-23 14:19:51,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:51,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:19:51,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121194640] [2020-12-23 14:19:51,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:51,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:51,707 INFO L87 Difference]: Start difference. First operand 783 states and 970 transitions. Second operand 4 states. [2020-12-23 14:19:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:51,891 INFO L93 Difference]: Finished difference Result 911 states and 1130 transitions. [2020-12-23 14:19:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:51,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 14:19:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:51,897 INFO L225 Difference]: With dead ends: 911 [2020-12-23 14:19:51,897 INFO L226 Difference]: Without dead ends: 902 [2020-12-23 14:19:51,898 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 [2020-12-23 14:19:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2020-12-23 14:19:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 787. [2020-12-23 14:19:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-23 14:19:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 970 transitions. [2020-12-23 14:19:52,075 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 970 transitions. Word has length 68 [2020-12-23 14:19:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:52,075 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 970 transitions. [2020-12-23 14:19:52,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 970 transitions. [2020-12-23 14:19:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 14:19:52,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:52,077 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] [2020-12-23 14:19:52,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 14:19:52,077 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]=== [2020-12-23 14:19:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1259237824, now seen corresponding path program 1 times [2020-12-23 14:19:52,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:52,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41956852] [2020-12-23 14:19:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:52,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41956852] [2020-12-23 14:19:52,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956759420] [2020-12-23 14:19:52,244 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 [2020-12-23 14:19:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:52,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:19:52,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:19:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:52,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 14:19:52,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-23 14:19:52,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315824840] [2020-12-23 14:19:52,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:52,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:52,828 INFO L87 Difference]: Start difference. First operand 787 states and 970 transitions. Second operand 4 states. [2020-12-23 14:19:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:52,948 INFO L93 Difference]: Finished difference Result 1134 states and 1408 transitions. [2020-12-23 14:19:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:52,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-12-23 14:19:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:52,950 INFO L225 Difference]: With dead ends: 1134 [2020-12-23 14:19:52,951 INFO L226 Difference]: Without dead ends: 379 [2020-12-23 14:19:52,952 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 [2020-12-23 14:19:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-12-23 14:19:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 347. [2020-12-23 14:19:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-12-23 14:19:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 404 transitions. [2020-12-23 14:19:53,058 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 404 transitions. Word has length 72 [2020-12-23 14:19:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:53,058 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 404 transitions. [2020-12-23 14:19:53,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 404 transitions. [2020-12-23 14:19:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 14:19:53,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:53,059 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] [2020-12-23 14:19:53,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 14:19:53,274 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]=== [2020-12-23 14:19:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1340649389, now seen corresponding path program 1 times [2020-12-23 14:19:53,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:53,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889009596] [2020-12-23 14:19:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:53,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889009596] [2020-12-23 14:19:53,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:53,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:53,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898100353] [2020-12-23 14:19:53,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:19:53,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:19:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:19:53,417 INFO L87 Difference]: Start difference. First operand 347 states and 404 transitions. Second operand 3 states. [2020-12-23 14:19:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:53,496 INFO L93 Difference]: Finished difference Result 572 states and 666 transitions. [2020-12-23 14:19:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:19:53,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 14:19:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:53,498 INFO L225 Difference]: With dead ends: 572 [2020-12-23 14:19:53,498 INFO L226 Difference]: Without dead ends: 270 [2020-12-23 14:19:53,499 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 [2020-12-23 14:19:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-12-23 14:19:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-12-23 14:19:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-23 14:19:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2020-12-23 14:19:53,557 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 81 [2020-12-23 14:19:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:53,557 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2020-12-23 14:19:53,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:19:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2020-12-23 14:19:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 14:19:53,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:53,558 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] [2020-12-23 14:19:53,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 14:19:53,558 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]=== [2020-12-23 14:19:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1965874040, now seen corresponding path program 1 times [2020-12-23 14:19:53,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:53,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52709662] [2020-12-23 14:19:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:54,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52709662] [2020-12-23 14:19:54,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:54,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:19:54,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670096282] [2020-12-23 14:19:54,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:19:54,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:19:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:19:54,136 INFO L87 Difference]: Start difference. First operand 270 states and 305 transitions. Second operand 4 states. [2020-12-23 14:19:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:54,273 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2020-12-23 14:19:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:19:54,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 14:19:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:54,275 INFO L225 Difference]: With dead ends: 272 [2020-12-23 14:19:54,275 INFO L226 Difference]: Without dead ends: 222 [2020-12-23 14:19:54,276 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 [2020-12-23 14:19:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-12-23 14:19:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2020-12-23 14:19:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-12-23 14:19:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2020-12-23 14:19:54,314 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 83 [2020-12-23 14:19:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:54,314 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2020-12-23 14:19:54,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:19:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2020-12-23 14:19:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 14:19:54,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:19:54,320 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] [2020-12-23 14:19:54,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 14:19:54,320 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]=== [2020-12-23 14:19:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:19:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2143833696, now seen corresponding path program 1 times [2020-12-23 14:19:54,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:19:54,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186143705] [2020-12-23 14:19:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:19:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:19:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:19:54,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186143705] [2020-12-23 14:19:54,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:19:54,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:19:54,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569316465] [2020-12-23 14:19:54,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:19:54,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:19:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:19:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:19:54,774 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 5 states. [2020-12-23 14:19:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:19:54,916 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2020-12-23 14:19:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:19:54,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-12-23 14:19:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:19:54,917 INFO L225 Difference]: With dead ends: 138 [2020-12-23 14:19:54,917 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 14:19:54,918 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 [2020-12-23 14:19:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 14:19:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 14:19:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 14:19:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 14:19:54,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2020-12-23 14:19:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:19:54,919 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 14:19:54,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:19:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 14:19:54,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 14:19:54,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 14:19:54,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 14:19:55,682 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 149 [2020-12-23 14:19:56,162 WARN L197 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 146 [2020-12-23 14:19:56,392 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 127 [2020-12-23 14:19:56,749 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-12-23 14:19:56,858 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2020-12-23 14:19:57,574 WARN L197 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 150 [2020-12-23 14:19:57,946 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-12-23 14:19:58,439 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 152 [2020-12-23 14:19:58,693 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 51 [2020-12-23 14:19:59,136 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2020-12-23 14:19:59,271 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 126 [2020-12-23 14:19:59,669 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 141 [2020-12-23 14:19:59,879 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2020-12-23 14:20:00,185 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 117 [2020-12-23 14:20:00,444 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-12-23 14:20:00,652 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 97 [2020-12-23 14:20:00,971 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 137 [2020-12-23 14:20:01,145 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2020-12-23 14:20:01,732 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2020-12-23 14:20:02,347 WARN L197 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 67 [2020-12-23 14:20:02,961 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 25 [2020-12-23 14:20:03,533 WARN L197 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2020-12-23 14:20:04,054 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-12-23 14:20:04,439 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2020-12-23 14:20:04,549 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-12-23 14:20:05,575 WARN L197 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 54 [2020-12-23 14:20:05,722 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2020-12-23 14:20:05,992 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-12-23 14:20:06,307 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2020-12-23 14:20:07,158 WARN L197 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 24 [2020-12-23 14:20:07,464 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 14:20:07,801 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-12-23 14:20:08,112 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-12-23 14:20:08,698 WARN L197 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2020-12-23 14:20:09,154 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2020-12-23 14:20:09,945 WARN L197 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 49 [2020-12-23 14:20:10,410 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 52 [2020-12-23 14:20:10,953 WARN L197 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2020-12-23 14:20:11,415 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-12-23 14:20:11,678 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 6 [2020-12-23 14:20:11,888 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 22 [2020-12-23 14:20:12,235 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2020-12-23 14:20:12,706 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 23 [2020-12-23 14:20:13,190 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2020-12-23 14:20:13,485 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-12-23 14:20:14,170 WARN L197 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 34 [2020-12-23 14:20:14,238 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)) [2020-12-23 14:20:14,238 INFO L189 CegarLoopUtils]: For program point L4098-1(lines 4097 4116) no Hoare annotation was computed. [2020-12-23 14:20:14,238 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))) [2020-12-23 14:20:14,238 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,239 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)) [2020-12-23 14:20:14,239 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))))) [2020-12-23 14:20:14,239 INFO L189 CegarLoopUtils]: For program point L4264(lines 4264 4266) no Hoare annotation was computed. [2020-12-23 14:20:14,239 INFO L189 CegarLoopUtils]: For program point L4099-1(lines 4097 4116) no Hoare annotation was computed. [2020-12-23 14:20:14,239 INFO L189 CegarLoopUtils]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2020-12-23 14:20:14,239 INFO L189 CegarLoopUtils]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2020-12-23 14:20:14,239 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)) [2020-12-23 14:20:14,240 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)) [2020-12-23 14:20:14,240 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))))))) [2020-12-23 14:20:14,240 INFO L189 CegarLoopUtils]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2020-12-23 14:20:14,240 INFO L189 CegarLoopUtils]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2020-12-23 14:20:14,241 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))) [2020-12-23 14:20:14,241 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)) [2020-12-23 14:20:14,241 INFO L189 CegarLoopUtils]: For program point L4203(line 4203) no Hoare annotation was computed. [2020-12-23 14:20:14,241 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)) [2020-12-23 14:20:14,241 INFO L189 CegarLoopUtils]: For program point L4203-4(line 4203) no Hoare annotation was computed. [2020-12-23 14:20:14,241 INFO L189 CegarLoopUtils]: For program point L4203-2(line 4203) no Hoare annotation was computed. [2020-12-23 14:20:14,241 INFO L189 CegarLoopUtils]: For program point L4203-8(line 4203) no Hoare annotation was computed. [2020-12-23 14:20:14,242 INFO L189 CegarLoopUtils]: For program point L4203-6(line 4203) no Hoare annotation was computed. [2020-12-23 14:20:14,242 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)) [2020-12-23 14:20:14,242 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)))) [2020-12-23 14:20:14,242 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)))) [2020-12-23 14:20:14,242 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)))) [2020-12-23 14:20:14,243 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))) [2020-12-23 14:20:14,243 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)))) [2020-12-23 14:20:14,243 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)) [2020-12-23 14:20:14,243 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)))) [2020-12-23 14:20:14,243 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)) [2020-12-23 14:20:14,243 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,243 INFO L189 CegarLoopUtils]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2020-12-23 14:20:14,244 INFO L189 CegarLoopUtils]: For program point L4106-2(lines 4106 4111) no Hoare annotation was computed. [2020-12-23 14:20:14,244 INFO L189 CegarLoopUtils]: For program point L4073(line 4073) no Hoare annotation was computed. [2020-12-23 14:20:14,244 INFO L189 CegarLoopUtils]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2020-12-23 14:20:14,244 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)) [2020-12-23 14:20:14,244 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))) [2020-12-23 14:20:14,244 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)))) [2020-12-23 14:20:14,244 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,244 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)))) [2020-12-23 14:20:14,245 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)))) [2020-12-23 14:20:14,245 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)))) [2020-12-23 14:20:14,245 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)) [2020-12-23 14:20:14,245 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)) [2020-12-23 14:20:14,245 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,245 INFO L185 CegarLoopUtils]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,246 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)) [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L4046(lines 1 4266) no Hoare annotation was computed. [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L4046-2(lines 1 4266) no Hoare annotation was computed. [2020-12-23 14:20:14,246 INFO L189 CegarLoopUtils]: For program point L4046-1(lines 1 4266) no Hoare annotation was computed. [2020-12-23 14:20:14,247 INFO L189 CegarLoopUtils]: For program point L4046-4(lines 4190 4195) no Hoare annotation was computed. [2020-12-23 14:20:14,247 INFO L189 CegarLoopUtils]: For program point L4046-3(lines 1 4266) no Hoare annotation was computed. [2020-12-23 14:20:14,247 INFO L185 CegarLoopUtils]: At program point L4046-5(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2020-12-23 14:20:14,247 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))) [2020-12-23 14:20:14,247 INFO L189 CegarLoopUtils]: For program point L3981(line 3981) no Hoare annotation was computed. [2020-12-23 14:20:14,247 INFO L189 CegarLoopUtils]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2020-12-23 14:20:14,247 INFO L189 CegarLoopUtils]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2020-12-23 14:20:14,248 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)) [2020-12-23 14:20:14,248 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)) [2020-12-23 14:20:14,248 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)) [2020-12-23 14:20:14,248 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)) [2020-12-23 14:20:14,248 INFO L189 CegarLoopUtils]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,248 INFO L189 CegarLoopUtils]: For program point L4049(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,248 INFO L189 CegarLoopUtils]: For program point L4049-3(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,248 INFO L189 CegarLoopUtils]: For program point L4049-2(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point L4049-5(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point L4049-4(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 14:20:14,249 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)) [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2020-12-23 14:20:14,249 INFO L189 CegarLoopUtils]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2020-12-23 14:20:14,249 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))))) [2020-12-23 14:20:14,250 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))) [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2020-12-23 14:20:14,250 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)) [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2020-12-23 14:20:14,250 INFO L189 CegarLoopUtils]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2020-12-23 14:20:14,251 INFO L189 CegarLoopUtils]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2020-12-23 14:20:14,251 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)))) [2020-12-23 14:20:14,251 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 14:20:14,251 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)) [2020-12-23 14:20:14,251 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))) [2020-12-23 14:20:14,251 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)) [2020-12-23 14:20:14,252 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))) [2020-12-23 14:20:14,252 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)) [2020-12-23 14:20:14,252 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)) [2020-12-23 14:20:14,252 INFO L189 CegarLoopUtils]: For program point L4155-1(lines 4154 4173) no Hoare annotation was computed. [2020-12-23 14:20:14,252 INFO L189 CegarLoopUtils]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2020-12-23 14:20:14,252 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))) [2020-12-23 14:20:14,253 INFO L189 CegarLoopUtils]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2020-12-23 14:20:14,253 INFO L189 CegarLoopUtils]: For program point L4156-1(lines 4154 4173) no Hoare annotation was computed. [2020-12-23 14:20:14,253 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)) [2020-12-23 14:20:14,253 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 14:20:14,253 INFO L192 CegarLoopUtils]: At program point L4058(lines 4058 4059) the Hoare annotation is: true [2020-12-23 14:20:14,253 INFO L192 CegarLoopUtils]: At program point L4058-2(lines 4058 4059) the Hoare annotation is: true [2020-12-23 14:20:14,253 INFO L192 CegarLoopUtils]: At program point L4058-1(lines 4058 4059) the Hoare annotation is: true [2020-12-23 14:20:14,253 INFO L192 CegarLoopUtils]: At program point L4058-3(lines 4058 4059) the Hoare annotation is: true [2020-12-23 14:20:14,253 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)) [2020-12-23 14:20:14,254 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)) [2020-12-23 14:20:14,254 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)) [2020-12-23 14:20:14,254 INFO L189 CegarLoopUtils]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2020-12-23 14:20:14,254 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))))))) [2020-12-23 14:20:14,254 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))))))) [2020-12-23 14:20:14,255 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))) [2020-12-23 14:20:14,255 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)))) [2020-12-23 14:20:14,255 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)))) [2020-12-23 14:20:14,255 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)) [2020-12-23 14:20:14,255 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)) [2020-12-23 14:20:14,255 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 14:20:14,255 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)) [2020-12-23 14:20:14,256 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2020-12-23 14:20:14,256 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)) [2020-12-23 14:20:14,256 INFO L189 CegarLoopUtils]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2020-12-23 14:20:14,256 INFO L189 CegarLoopUtils]: For program point L4130(line 4130) no Hoare annotation was computed. [2020-12-23 14:20:14,256 INFO L189 CegarLoopUtils]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2020-12-23 14:20:14,256 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))) [2020-12-23 14:20:14,256 INFO L189 CegarLoopUtils]: For program point L4163-2(lines 4163 4168) no Hoare annotation was computed. [2020-12-23 14:20:14,257 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))))))) [2020-12-23 14:20:14,257 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)) [2020-12-23 14:20:14,257 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)) [2020-12-23 14:20:14,257 INFO L189 CegarLoopUtils]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2020-12-23 14:20:14,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 02:20:14 BoogieIcfgContainer [2020-12-23 14:20:14,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 14:20:14,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 14:20:14,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 14:20:14,358 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 14:20:14,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:19:42" (3/4) ... [2020-12-23 14:20:14,362 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 14:20:14,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2020-12-23 14:20:14,389 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2020-12-23 14:20:14,390 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-23 14:20:14,392 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-23 14:20:14,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 14:20:14,430 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) [2020-12-23 14:20:14,430 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)) [2020-12-23 14:20:14,431 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)) [2020-12-23 14:20:14,431 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)) [2020-12-23 14:20:14,431 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 [2020-12-23 14:20:14,432 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 [2020-12-23 14:20:14,432 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 [2020-12-23 14:20:14,432 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 [2020-12-23 14:20:14,432 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 [2020-12-23 14:20:14,433 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) [2020-12-23 14:20:14,433 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 [2020-12-23 14:20:14,433 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) [2020-12-23 14:20:14,433 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 [2020-12-23 14:20:14,433 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) [2020-12-23 14:20:14,433 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 [2020-12-23 14:20:14,434 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) [2020-12-23 14:20:14,434 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 [2020-12-23 14:20:14,434 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) [2020-12-23 14:20:14,434 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,435 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) [2020-12-23 14:20:14,436 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 [2020-12-23 14:20:14,436 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) [2020-12-23 14:20:14,436 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) [2020-12-23 14:20:14,436 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)) [2020-12-23 14:20:14,436 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) [2020-12-23 14:20:14,436 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) [2020-12-23 14:20:14,437 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 [2020-12-23 14:20:14,437 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) [2020-12-23 14:20:14,437 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) [2020-12-23 14:20:14,437 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) [2020-12-23 14:20:14,437 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) [2020-12-23 14:20:14,437 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) [2020-12-23 14:20:14,437 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)) [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,438 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 [2020-12-23 14:20:14,439 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 [2020-12-23 14:20:14,439 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 [2020-12-23 14:20:14,439 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 [2020-12-23 14:20:14,439 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 [2020-12-23 14:20:14,439 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 [2020-12-23 14:20:14,440 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 [2020-12-23 14:20:14,440 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 [2020-12-23 14:20:14,440 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 [2020-12-23 14:20:14,440 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 [2020-12-23 14:20:14,440 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 [2020-12-23 14:20:14,700 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 [2020-12-23 14:20:14,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 14:20:14,702 INFO L168 Benchmark]: Toolchain (without parser) took 35865.30 ms. Allocated memory was 169.9 MB in the beginning and 607.1 MB in the end (delta: 437.3 MB). Free memory was 140.1 MB in the beginning and 219.1 MB in the end (delta: -78.9 MB). Peak memory consumption was 358.2 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,702 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 169.9 MB. Free memory is still 142.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 14:20:14,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1293.50 ms. Allocated memory is still 169.9 MB. Free memory was 140.0 MB in the beginning and 97.6 MB in the end (delta: 42.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.68 ms. Allocated memory is still 169.9 MB. Free memory was 97.6 MB in the beginning and 91.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,703 INFO L168 Benchmark]: Boogie Preprocessor took 134.49 ms. Allocated memory is still 169.9 MB. Free memory was 91.3 MB in the beginning and 85.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,704 INFO L168 Benchmark]: RCFGBuilder took 1699.30 ms. Allocated memory was 169.9 MB in the beginning and 209.7 MB in the end (delta: 39.8 MB). Free memory was 85.5 MB in the beginning and 162.9 MB in the end (delta: -77.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,704 INFO L168 Benchmark]: TraceAbstraction took 32279.95 ms. Allocated memory was 209.7 MB in the beginning and 607.1 MB in the end (delta: 397.4 MB). Free memory was 162.4 MB in the beginning and 282.5 MB in the end (delta: -120.1 MB). Peak memory consumption was 354.4 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,704 INFO L168 Benchmark]: Witness Printer took 342.69 ms. Allocated memory is still 607.1 MB. Free memory was 282.5 MB in the beginning and 219.1 MB in the end (delta: 63.4 MB). Peak memory consumption was 61.9 MB. Max. memory is 8.0 GB. [2020-12-23 14:20:14,708 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.19 ms. Allocated memory is still 169.9 MB. Free memory is still 142.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1293.50 ms. Allocated memory is still 169.9 MB. Free memory was 140.0 MB in the beginning and 97.6 MB in the end (delta: 42.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.68 ms. Allocated memory is still 169.9 MB. Free memory was 97.6 MB in the beginning and 91.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 134.49 ms. Allocated memory is still 169.9 MB. Free memory was 91.3 MB in the beginning and 85.5 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1699.30 ms. Allocated memory was 169.9 MB in the beginning and 209.7 MB in the end (delta: 39.8 MB). Free memory was 85.5 MB in the beginning and 162.9 MB in the end (delta: -77.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32279.95 ms. Allocated memory was 209.7 MB in the beginning and 607.1 MB in the end (delta: 397.4 MB). Free memory was 162.4 MB in the beginning and 282.5 MB in the end (delta: -120.1 MB). Peak memory consumption was 354.4 MB. Max. memory is 8.0 GB. * Witness Printer took 342.69 ms. Allocated memory is still 607.1 MB. Free memory was 282.5 MB in the beginning and 219.1 MB in the end (delta: 63.4 MB). Peak memory consumption was 61.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.7s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.3s, 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.9s 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: 2.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 7542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 222 NumberOfFragments, 3416 HoareAnnotationTreeSize, 68 FomulaSimplifications, 61795123 FormulaSimplificationTreeSizeReduction, 6.3s HoareSimplificationTime, 68 FomulaSimplificationsInter, 402356 FormulaSimplificationTreeSizeReductionInter, 12.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 2.1s 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...