java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:21:39,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:21:39,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:21:39,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:21:39,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:21:39,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:21:39,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:21:39,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:21:39,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:21:39,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:21:39,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:21:39,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:21:39,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:21:39,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:21:39,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:21:39,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:21:39,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:21:39,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:21:39,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:21:39,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:21:39,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:21:39,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:21:39,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:21:39,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:21:39,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:21:39,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:21:39,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:21:39,179 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:21:39,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:21:39,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:21:39,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:21:39,180 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:21:39,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:21:39,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:21:39,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:21:39,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:21:39,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:21:39,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:21:39,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:21:39,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:21:39,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:21:39,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:21:39,222 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:21:39,224 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:21:39,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:21:39,225 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:21:39,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i [2018-02-02 10:21:39,366 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:21:39,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:21:39,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:21:39,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:21:39,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:21:39,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39, skipping insertion in model container [2018-02-02 10:21:39,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,392 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:21:39,430 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:21:39,531 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:21:39,551 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:21:39,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39 WrapperNode [2018-02-02 10:21:39,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:21:39,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:21:39,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:21:39,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:21:39,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... [2018-02-02 10:21:39,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:21:39,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:21:39,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:21:39,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:21:39,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/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 [2018-02-02 10:21:39,628 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:21:39,628 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:21:39,628 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-02-02 10:21:39,628 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 10:21:39,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-02-02 10:21:39,630 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-02-02 10:21:39,630 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-02-02 10:21:39,630 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-02-02 10:21:39,630 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:21:39,630 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:21:39,630 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:21:39,630 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:21:39,630 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-02-02 10:21:39,631 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:21:39,631 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-02-02 10:21:39,632 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:21:39,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:21:39,972 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:21:39,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:21:39 BoogieIcfgContainer [2018-02-02 10:21:39,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:21:39,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:21:39,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:21:39,976 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:21:39,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:21:39" (1/3) ... [2018-02-02 10:21:39,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674f7c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:21:39, skipping insertion in model container [2018-02-02 10:21:39,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:21:39" (2/3) ... [2018-02-02 10:21:39,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674f7c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:21:39, skipping insertion in model container [2018-02-02 10:21:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:21:39" (3/3) ... [2018-02-02 10:21:39,978 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-02-02 10:21:39,983 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:21:39,992 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 10:21:40,022 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:21:40,022 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:21:40,023 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:21:40,023 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:21:40,023 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:21:40,023 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:21:40,023 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:21:40,023 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:21:40,023 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:21:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-02-02 10:21:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:21:40,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:40,045 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:40,045 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -26265707, now seen corresponding path program 1 times [2018-02-02 10:21:40,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:40,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:40,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:21:40,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,213 INFO L182 omatonBuilderFactory]: Interpolants [176#true, 177#false, 178#(= |#valid| |old(#valid)|)] [2018-02-02 10:21:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:21:40,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:21:40,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:21:40,276 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2018-02-02 10:21:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:40,489 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2018-02-02 10:21:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:21:40,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:21:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:40,509 INFO L225 Difference]: With dead ends: 230 [2018-02-02 10:21:40,509 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 10:21:40,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:21:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 10:21:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-02-02 10:21:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:21:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-02-02 10:21:40,560 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 16 [2018-02-02 10:21:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:40,561 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-02-02 10:21:40,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:21:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-02-02 10:21:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:21:40,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:40,563 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:40,563 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash -325108585, now seen corresponding path program 1 times [2018-02-02 10:21:40,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:40,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:40,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:40,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,623 INFO L182 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(not (= |ldv_malloc_#t~malloc2.base| 0)), 586#(not (= |ldv_malloc_#res.base| 0)), 587#(not (= |entry_point_#t~ret24.base| 0)), 588#(not (= entry_point_~hdev~0.base 0))] [2018-02-02 10:21:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:40,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:40,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:40,627 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 6 states. [2018-02-02 10:21:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:40,686 INFO L93 Difference]: Finished difference Result 215 states and 240 transitions. [2018-02-02 10:21:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:40,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:21:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:40,689 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:21:40,690 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:21:40,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:21:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 170. [2018-02-02 10:21:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:21:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-02 10:21:40,701 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 18 [2018-02-02 10:21:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:40,702 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-02 10:21:40,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-02 10:21:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:21:40,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:40,703 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:40,703 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 743711378, now seen corresponding path program 1 times [2018-02-02 10:21:40,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:40,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:40,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:21:40,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,762 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 979#(and (= 0 |entry_point_#t~ret24.offset|) (= 0 |entry_point_#t~ret24.base|)), 980#(and (= 0 entry_point_~hdev~0.base) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 10:21:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:40,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:40,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:40,763 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 5 states. [2018-02-02 10:21:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:40,776 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-02-02 10:21:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:40,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 10:21:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:40,779 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:21:40,779 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:21:40,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:21:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 10:21:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:21:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-02-02 10:21:40,788 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 21 [2018-02-02 10:21:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:40,788 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-02-02 10:21:40,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-02-02 10:21:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:21:40,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:40,789 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:40,790 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash 667479760, now seen corresponding path program 1 times [2018-02-02 10:21:40,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:40,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:40,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:21:40,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,846 INFO L182 omatonBuilderFactory]: Interpolants [1328#false, 1329#(= 0 |ldv_malloc_#t~malloc2.offset|), 1330#(= 0 |ldv_malloc_#res.offset|), 1331#(= 0 |entry_point_#t~ret24.offset|), 1332#(= 0 entry_point_~hdev~0.offset), 1327#true] [2018-02-02 10:21:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:40,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:40,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:40,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:40,847 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 6 states. [2018-02-02 10:21:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:40,869 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 10:21:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:40,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:21:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:40,870 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:21:40,870 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:21:40,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:21:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-02-02 10:21:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:21:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-02-02 10:21:40,875 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 23 [2018-02-02 10:21:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:40,875 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-02-02 10:21:40,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-02-02 10:21:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:21:40,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:40,876 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:40,876 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash 667479761, now seen corresponding path program 1 times [2018-02-02 10:21:40,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:40,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:40,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:40,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,925 INFO L182 omatonBuilderFactory]: Interpolants [1680#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 1681#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1682#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 1683#(= 1 (select |#valid| entry_point_~hdev~0.base)), 1684#(= |#valid| |old(#valid)|), 1678#true, 1679#false] [2018-02-02 10:21:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:21:40,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:40,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:40,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:40,926 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 7 states. [2018-02-02 10:21:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:41,250 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2018-02-02 10:21:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:41,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 10:21:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:41,252 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:21:41,252 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:21:41,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:21:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 184. [2018-02-02 10:21:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:21:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2018-02-02 10:21:41,260 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 23 [2018-02-02 10:21:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:41,260 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2018-02-02 10:21:41,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-02-02 10:21:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:21:41,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:41,261 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:41,261 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash -314305773, now seen corresponding path program 1 times [2018-02-02 10:21:41,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:41,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:41,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:41,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,306 INFO L182 omatonBuilderFactory]: Interpolants [2087#true, 2088#false, 2089#(not (= |ldv_malloc_#t~malloc2.base| 0)), 2090#(not (= |ldv_malloc_#res.base| 0)), 2091#(not (= |entry_point_#t~ret25.base| 0)), 2092#(not (= entry_point_~intf~2.base 0))] [2018-02-02 10:21:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:41,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:41,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:41,307 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand 6 states. [2018-02-02 10:21:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:41,377 INFO L93 Difference]: Finished difference Result 220 states and 251 transitions. [2018-02-02 10:21:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:21:41,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:21:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:41,379 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:21:41,380 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:21:41,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:21:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 184. [2018-02-02 10:21:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:21:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-02-02 10:21:41,387 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 25 [2018-02-02 10:21:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:41,387 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-02-02 10:21:41,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-02-02 10:21:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:21:41,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:41,388 INFO L351 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] [2018-02-02 10:21:41,389 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -808960356, now seen corresponding path program 1 times [2018-02-02 10:21:41,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:41,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:41,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:41,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:41,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:41,501 INFO L182 omatonBuilderFactory]: Interpolants [2499#true, 2500#false, 2501#(= |#valid| |old(#valid)|), 2502#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 2503#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 2504#(and (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret24.base| (select |#valid| |entry_point_#t~ret24.base|)))), 2505#(and (= (store |old(#valid)| entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0))] [2018-02-02 10:21:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:41,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:41,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:41,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:41,502 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 7 states. [2018-02-02 10:21:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:41,858 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2018-02-02 10:21:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:41,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:21:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:41,861 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:21:41,861 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:21:41,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:21:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2018-02-02 10:21:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:21:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 10:21:41,865 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 26 [2018-02-02 10:21:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:41,865 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 10:21:41,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 10:21:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:21:41,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:41,866 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:41,866 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:41,866 INFO L82 PathProgramCache]: Analyzing trace with hash 437179314, now seen corresponding path program 1 times [2018-02-02 10:21:41,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:41,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:41,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:41,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:21:41,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:41,910 INFO L182 omatonBuilderFactory]: Interpolants [2913#true, 2914#false, 2915#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 2916#(and (= 0 |entry_point_#t~ret25.base|) (= 0 |entry_point_#t~ret25.offset|)), 2917#(and (= 0 entry_point_~intf~2.base) (= entry_point_~intf~2.offset 0))] [2018-02-02 10:21:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:41,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:41,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:41,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:41,910 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 5 states. [2018-02-02 10:21:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:41,930 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-02-02 10:21:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:41,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 10:21:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:41,932 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:21:41,932 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:21:41,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:21:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-02-02 10:21:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:21:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2018-02-02 10:21:41,936 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 28 [2018-02-02 10:21:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:41,936 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2018-02-02 10:21:41,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2018-02-02 10:21:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:21:41,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:41,937 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:41,937 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1753876656, now seen corresponding path program 2 times [2018-02-02 10:21:41,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:41,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:41,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:21:41,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,992 INFO L182 omatonBuilderFactory]: Interpolants [3264#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 3265#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3266#(= 1 (select |#valid| |entry_point_#t~ret25.base|)), 3267#(= 1 (select |#valid| entry_point_~intf~2.base)), 3268#(= |#valid| |old(#valid)|), 3262#true, 3263#false] [2018-02-02 10:21:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:41,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:41,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:41,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:41,994 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand 7 states. [2018-02-02 10:21:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:42,253 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2018-02-02 10:21:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:42,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:21:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:42,255 INFO L225 Difference]: With dead ends: 189 [2018-02-02 10:21:42,255 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:21:42,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:21:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-02-02 10:21:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:21:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-02-02 10:21:42,260 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 30 [2018-02-02 10:21:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:42,260 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-02-02 10:21:42,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-02-02 10:21:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:21:42,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:42,264 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:42,264 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1753876657, now seen corresponding path program 1 times [2018-02-02 10:21:42,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:42,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:42,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:42,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:21:42,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:42,429 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 3649#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 3650#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 3651#(and (<= 20 (select |#length| |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|)), 3652#(and (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 3653#(= |old(#length)| |#length|), 3646#true, 3647#false] [2018-02-02 10:21:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:42,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:21:42,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:21:42,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:42,430 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-02-02 10:21:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:42,835 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-02-02 10:21:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:42,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 10:21:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:42,840 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:21:42,841 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:21:42,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:21:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2018-02-02 10:21:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:21:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2018-02-02 10:21:42,848 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 30 [2018-02-02 10:21:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:42,848 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2018-02-02 10:21:42,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:21:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2018-02-02 10:21:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:21:42,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:42,849 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:42,849 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1756950194, now seen corresponding path program 1 times [2018-02-02 10:21:42,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:42,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:42,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:42,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:21:42,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:42,946 INFO L182 omatonBuilderFactory]: Interpolants [4081#true, 4082#false, 4083#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 4084#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4085#(= 1 (select |#valid| |entry_point_#t~ret25.base|)), 4086#(= 1 (select |#valid| entry_point_~intf~2.base)), 4087#(= |#valid| |old(#valid)|), 4088#(and (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4089#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:21:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:42,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:21:42,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:21:42,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:42,947 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand 9 states. [2018-02-02 10:21:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:43,356 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2018-02-02 10:21:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:43,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:21:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:43,357 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:21:43,357 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:21:43,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:21:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2018-02-02 10:21:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 10:21:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-02-02 10:21:43,363 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 32 [2018-02-02 10:21:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:43,363 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-02-02 10:21:43,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:21:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2018-02-02 10:21:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:21:43,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:43,368 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:43,368 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1756950195, now seen corresponding path program 1 times [2018-02-02 10:21:43,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:43,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:43,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:43,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:43,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:43,648 INFO L182 omatonBuilderFactory]: Interpolants [4528#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4529#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 4530#(and (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 4520#true, 4521#false, 4522#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 4523#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 4524#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 4525#(and (<= 20 (select |#length| |entry_point_#t~ret25.base|)) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (= 0 |entry_point_#t~ret25.offset|)), 4526#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 4527#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-02 10:21:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:43,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:43,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:43,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:43,649 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand 11 states. [2018-02-02 10:21:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,154 INFO L93 Difference]: Finished difference Result 209 states and 244 transitions. [2018-02-02 10:21:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:21:44,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-02 10:21:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,156 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:21:44,156 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:21:44,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:21:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:21:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 179. [2018-02-02 10:21:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:21:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-02-02 10:21:44,163 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 32 [2018-02-02 10:21:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,164 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-02-02 10:21:44,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-02-02 10:21:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:21:44,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,165 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:21:44,165 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 860002885, now seen corresponding path program 1 times [2018-02-02 10:21:44,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:44,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:44,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:44,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:44,288 INFO L182 omatonBuilderFactory]: Interpolants [4928#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 4929#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4930#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 4931#(= 1 (select |#valid| entry_point_~hdev~0.base)), 4932#(= |#valid| |old(#valid)|), 4933#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4934#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4935#(and (not (= |entry_point_#t~ret25.base| 0)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 4936#(and (not (= entry_point_~intf~2.base 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 4926#true, 4927#false] [2018-02-02 10:21:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:21:44,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:44,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:44,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:44,289 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 11 states. [2018-02-02 10:21:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,664 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-02-02 10:21:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:44,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 10:21:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,665 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:21:44,665 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:21:44,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:21:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-02-02 10:21:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:21:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-02-02 10:21:44,668 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 35 [2018-02-02 10:21:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,668 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-02-02 10:21:44,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-02-02 10:21:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:21:44,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,669 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:21:44,669 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:44,669 INFO L82 PathProgramCache]: Analyzing trace with hash 890317459, now seen corresponding path program 1 times [2018-02-02 10:21:44,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:44,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:44,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:44,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:44,720 INFO L182 omatonBuilderFactory]: Interpolants [5313#true, 5314#false, 5315#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 5316#(and (= 0 |entry_point_#t~ret26.base|) (= 0 |entry_point_#t~ret26.offset|)), 5317#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 5318#(and (= |entry_point_#t~mem28.base| 0) (= |entry_point_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))] [2018-02-02 10:21:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:44,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:44,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:44,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:44,720 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 6 states. [2018-02-02 10:21:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:44,779 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2018-02-02 10:21:44,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:44,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:21:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:44,780 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:21:44,780 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:21:44,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:21:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-02 10:21:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:21:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2018-02-02 10:21:44,785 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 36 [2018-02-02 10:21:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:44,785 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2018-02-02 10:21:44,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2018-02-02 10:21:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:21:44,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:44,786 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:21:44,787 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash 866086568, now seen corresponding path program 1 times [2018-02-02 10:21:44,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:44,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:45,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:45,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:21:45,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:45,088 INFO L182 omatonBuilderFactory]: Interpolants [5696#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 5697#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5698#(and (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret24.base| (select |#valid| |entry_point_#t~ret24.base|)))), 5699#(and (= (store |old(#valid)| entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 5700#(and (not (= |entry_point_#t~ret25.base| 0)) (not (= 0 entry_point_~hdev~0.base)) (or (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|) (and (= (select |old(#valid)| |entry_point_#t~ret25.base|) 0) (= (store (store |old(#valid)| |entry_point_#t~ret25.base| (select |#valid| |entry_point_#t~ret25.base|)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)))), 5701#(and (or (= entry_point_~intf~2.base entry_point_~hdev~0.base) (and (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|))) (not (= 0 entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base 0))), 5702#(and (not (= 0 entry_point_~hdev~0.base)) (or (and (= (select |old(#valid)| entry_point_~hdev~0.base) (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (= (select |old(#valid)| (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))) (select (store |#valid| entry_point_~hdev~0.base 0) (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))))) (= 0 (select |#valid| entry_point_~hdev~0.base)))), 5693#true, 5694#false, 5695#(= |#valid| |old(#valid)|)] [2018-02-02 10:21:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:21:45,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:21:45,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:21:45,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:45,088 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand 10 states. [2018-02-02 10:21:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,618 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-02-02 10:21:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:21:45,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 10:21:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,619 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:21:45,619 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:21:45,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:21:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2018-02-02 10:21:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:21:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2018-02-02 10:21:45,624 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 38 [2018-02-02 10:21:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,624 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2018-02-02 10:21:45,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:21:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2018-02-02 10:21:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:21:45,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,625 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,625 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash 499648277, now seen corresponding path program 1 times [2018-02-02 10:21:45,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:45,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:45,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:45,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:45,685 INFO L182 omatonBuilderFactory]: Interpolants [6081#true, 6082#false, 6083#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 6084#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6085#(= 1 (select |#valid| |entry_point_#t~ret26.base|)), 6086#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 6087#(= 1 (select |#valid| |entry_point_#t~mem29.base|))] [2018-02-02 10:21:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:45,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:45,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:45,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:45,686 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand 7 states. [2018-02-02 10:21:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:45,837 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2018-02-02 10:21:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:45,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 10:21:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:45,839 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:21:45,839 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:21:45,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:21:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-02-02 10:21:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:21:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2018-02-02 10:21:45,844 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 38 [2018-02-02 10:21:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:45,844 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2018-02-02 10:21:45,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2018-02-02 10:21:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:21:45,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:45,845 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:45,845 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 499648278, now seen corresponding path program 1 times [2018-02-02 10:21:45,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:45,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:46,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:46,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:21:46,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:46,001 INFO L182 omatonBuilderFactory]: Interpolants [6448#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6449#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 6450#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 6451#(and (<= 9 (select |#length| |entry_point_#t~ret26.base|)) (= 0 |entry_point_#t~ret26.offset|)), 6452#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 6453#(and (= |entry_point_#t~mem29.offset| 0) (<= 9 (select |#length| |entry_point_#t~mem29.base|))), 6446#true, 6447#false] [2018-02-02 10:21:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:46,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:21:46,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:21:46,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:46,002 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand 8 states. [2018-02-02 10:21:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:46,279 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2018-02-02 10:21:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:21:46,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:21:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:46,281 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:21:46,281 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:21:46,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:21:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:21:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-02-02 10:21:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:21:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-02-02 10:21:46,287 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 38 [2018-02-02 10:21:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:46,287 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-02-02 10:21:46,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:21:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-02-02 10:21:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:21:46,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:46,288 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:46,288 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash -874341065, now seen corresponding path program 1 times [2018-02-02 10:21:46,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:46,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:46,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:46,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:21:46,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:46,661 INFO L182 omatonBuilderFactory]: Interpolants [6816#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6817#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (and (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (<= 2147483648 |ldv_malloc_#in~size|)) (<= 4294967296 |ldv_malloc_#in~size|))), 6818#(and (= 0 |ldv_malloc_#res.offset|) (or (and (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 2147483648 |ldv_malloc_#in~size|)) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6819#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|) (<= 12 (select |#length| |entry_point_#t~ret24.base|))), 6820#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 6821#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 6822#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 6823#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6824#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 6825#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 6826#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= entry_point_~hdev~0.offset 0)), 6814#true, 6815#false] [2018-02-02 10:21:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:21:46,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:21:46,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:21:46,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:46,662 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 13 states. [2018-02-02 10:21:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,290 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-02-02 10:21:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:21:47,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-02 10:21:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,291 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:21:47,291 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:21:47,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:21:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:21:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2018-02-02 10:21:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:21:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2018-02-02 10:21:47,294 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 40 [2018-02-02 10:21:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,294 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2018-02-02 10:21:47,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:21:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2018-02-02 10:21:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:21:47,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,295 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,295 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash -904842582, now seen corresponding path program 1 times [2018-02-02 10:21:47,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:47,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:21:47,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,345 INFO L182 omatonBuilderFactory]: Interpolants [7200#(not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)), 7201#(not (= |entry_point_#t~mem28.base| 0)), 7195#true, 7196#false, 7197#(not (= |ldv_malloc_#t~malloc2.base| 0)), 7198#(not (= |ldv_malloc_#res.base| 0)), 7199#(not (= |entry_point_#t~ret26.base| 0))] [2018-02-02 10:21:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:47,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:47,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:47,346 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand 7 states. [2018-02-02 10:21:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,398 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-02-02 10:21:47,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:47,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-02-02 10:21:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,399 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:21:47,399 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:21:47,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:21:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 10:21:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:21:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-02-02 10:21:47,404 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 40 [2018-02-02 10:21:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,404 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-02-02 10:21:47,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-02-02 10:21:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:21:47,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,405 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,405 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1596182576, now seen corresponding path program 1 times [2018-02-02 10:21:47,406 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:47,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:47,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:47,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:47,470 INFO L182 omatonBuilderFactory]: Interpolants [7552#true, 7553#false, 7554#(= 1 (select |#valid| entry_point_~hdev~0.base)), 7555#(= 1 (select |#valid| |ldv_arvo_probe_#in~hdev.base|)), 7556#(= 1 (select |#valid| ldv_arvo_probe_~hdev.base)), 7557#(= 1 (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|)), 7558#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base))] [2018-02-02 10:21:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:47,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:47,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:47,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:47,471 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 7 states. [2018-02-02 10:21:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,615 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-02-02 10:21:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:47,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-02-02 10:21:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,617 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:21:47,617 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:21:47,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:21:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2018-02-02 10:21:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:21:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-02-02 10:21:47,621 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 45 [2018-02-02 10:21:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,622 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-02-02 10:21:47,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-02-02 10:21:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:21:47,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,622 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,622 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1596182575, now seen corresponding path program 1 times [2018-02-02 10:21:47,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:47,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:21:47,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,726 INFO L182 omatonBuilderFactory]: Interpolants [7920#(and (<= 12 (select |#length| ldv_arvo_probe_~hdev.base)) (= 0 ldv_arvo_probe_~hdev.offset)), 7921#(and (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 7922#(and (= ldv_arvo_init_specials_~hdev.offset 0) (<= 12 (select |#length| ldv_arvo_init_specials_~hdev.base))), 7912#true, 7913#false, 7914#(= 0 |ldv_malloc_#t~malloc2.offset|), 7915#(= 0 |ldv_malloc_#res.offset|), 7916#(= 0 |entry_point_#t~ret24.offset|), 7917#(= 0 entry_point_~hdev~0.offset), 7918#(and (<= (+ entry_point_~hdev~0.offset 12) (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 7919#(and (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|)) (= 0 |ldv_arvo_probe_#in~hdev.offset|))] [2018-02-02 10:21:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:47,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:47,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:47,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:47,726 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 11 states. [2018-02-02 10:21:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:47,869 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2018-02-02 10:21:47,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:21:47,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-02-02 10:21:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:47,870 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:21:47,870 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:21:47,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:21:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:21:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2018-02-02 10:21:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:21:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-02-02 10:21:47,874 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 45 [2018-02-02 10:21:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:47,874 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-02-02 10:21:47,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-02-02 10:21:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:21:47,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:47,874 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:47,874 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash -628127471, now seen corresponding path program 1 times [2018-02-02 10:21:47,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:47,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:48,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:48,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:21:48,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:48,027 INFO L182 omatonBuilderFactory]: Interpolants [8288#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~mem14.base|)), 8289#(= 1 (select |#valid| ldv_arvo_init_specials_~intf~0.base)), 8276#true, 8277#false, 8278#(= 0 |ldv_malloc_#t~malloc2.offset|), 8279#(= 0 |ldv_malloc_#res.offset|), 8280#(= 0 |entry_point_#t~ret24.offset|), 8281#(= 0 entry_point_~hdev~0.offset), 8282#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 8283#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 0 entry_point_~hdev~0.offset)), 8284#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_probe_#in~hdev.offset|)), 8285#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8)))) (= 0 ldv_arvo_probe_~hdev.offset)), 8286#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 8287#(and (= ldv_arvo_init_specials_~hdev.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))] [2018-02-02 10:21:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:48,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:21:48,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:21:48,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:21:48,028 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 14 states. [2018-02-02 10:21:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:48,374 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 10:21:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:21:48,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 10:21:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:48,376 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:21:48,376 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:21:48,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:21:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:21:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-02-02 10:21:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:21:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-02-02 10:21:48,382 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 47 [2018-02-02 10:21:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:48,382 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-02-02 10:21:48,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:21:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-02-02 10:21:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:21:48,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:48,383 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:48,383 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash -628127470, now seen corresponding path program 1 times [2018-02-02 10:21:48,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:48,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:21:48,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:48,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:21:48,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:21:48,693 INFO L182 omatonBuilderFactory]: Interpolants [8642#true, 8643#false, 8644#(= 0 |ldv_malloc_#t~malloc2.offset|), 8645#(= 0 |ldv_malloc_#res.offset|), 8646#(= 0 |entry_point_#t~ret24.offset|), 8647#(= 0 entry_point_~hdev~0.offset), 8648#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 8649#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 8650#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 8651#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 8652#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 8653#(and (<= (+ entry_point_~intf~2.offset 8) (select |#length| entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 8654#(and (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (= 0 entry_point_~hdev~0.offset) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))))), 8655#(and (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_probe_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))), 8656#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8)))) (= 0 ldv_arvo_probe_~hdev.offset)), 8657#(and (= 0 |ldv_arvo_init_specials_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))))), 8658#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (= ldv_arvo_init_specials_~hdev.offset 0) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))))), 8659#(and (<= 8 |ldv_arvo_init_specials_#t~mem14.offset|) (<= |ldv_arvo_init_specials_#t~mem14.offset| (select |#length| |ldv_arvo_init_specials_#t~mem14.base|))), 8660#(and (<= (+ ldv_arvo_init_specials_~intf~0.offset 8) (select |#length| ldv_arvo_init_specials_~intf~0.base)) (<= 0 ldv_arvo_init_specials_~intf~0.offset))] [2018-02-02 10:21:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:21:48,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:21:48,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:21:48,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:21:48,694 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 19 states. [2018-02-02 10:21:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:49,053 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2018-02-02 10:21:49,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:21:49,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 10:21:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:49,054 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:21:49,054 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:21:49,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:21:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:21:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-02-02 10:21:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:21:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-02-02 10:21:49,058 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 47 [2018-02-02 10:21:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:49,058 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-02-02 10:21:49,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:21:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-02-02 10:21:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:21:49,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:49,059 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:49,059 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2002884989, now seen corresponding path program 1 times [2018-02-02 10:21:49,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:49,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:49,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:49,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:21:49,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:49,544 INFO L182 omatonBuilderFactory]: Interpolants [9024#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 9025#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 9026#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 9027#(and (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 9028#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 9029#(and (= 0 |ldv_arvo_probe_#in~hdev.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))))), 9030#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_probe_~hdev.offset)), 9031#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 9032#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))) (= ldv_arvo_init_specials_~hdev.offset 0)), 9033#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4)))), 9034#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))), 9035#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~mem15.base|)), 9013#true, 9014#false, 9015#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 9016#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9017#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 9018#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 9019#(= |#valid| |old(#valid)|), 9020#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 9021#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9022#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 9023#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 10:21:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:49,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:21:49,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:21:49,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:21:49,545 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 23 states. [2018-02-02 10:21:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:50,709 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 10:21:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:21:50,709 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-02-02 10:21:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:50,710 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:21:50,710 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:21:50,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:21:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:21:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2018-02-02 10:21:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:21:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2018-02-02 10:21:50,713 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 48 [2018-02-02 10:21:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:50,713 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2018-02-02 10:21:50,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:21:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2018-02-02 10:21:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:21:50,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:50,714 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:50,714 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2002884990, now seen corresponding path program 1 times [2018-02-02 10:21:50,715 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:50,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:51,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:51,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:21:51,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:51,403 INFO L182 omatonBuilderFactory]: Interpolants [9412#true, 9413#false, 9414#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 9415#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9416#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 9417#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 9418#(= |#valid| |old(#valid)|), 9419#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 9420#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9421#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 9422#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9423#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 9424#(or (<= 4294967296 |ldv_malloc_#in~size|) (and (or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|)) (and (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))), 9425#(or (and (or (and (= 0 |ldv_malloc_#res.offset|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0)) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 9426#(and (or (and (<= (+ (select |#length| |entry_point_#t~ret26.base|) 1) 0) (= 0 |entry_point_#t~ret26.offset|)) (and (<= 9 (select |#length| |entry_point_#t~ret26.base|)) (= 0 |entry_point_#t~ret26.offset|))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 9427#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (or (and (<= (+ (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 1) 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9428#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (or (and (= |entry_point_#t~mem29.base| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (<= 9 (select |#length| |entry_point_#t~mem29.base|))) (and (= |entry_point_#t~mem29.offset| 0) (<= (+ (select |#length| |entry_point_#t~mem29.base|) 1) 0)))), 9429#(and (= 0 (select (select (store |#memory_$Pointer$.offset| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) (+ entry_point_~intf~2.offset 8))) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (<= 9 (select |#length| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9430#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4))) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 9431#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))) (= 0 |ldv_arvo_probe_#in~hdev.offset|) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))))), 9432#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_probe_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))), 9433#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 9434#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))) (= ldv_arvo_init_specials_~hdev.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))), 9435#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4))) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4))))), 9436#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))), 9437#(and (<= 9 (select |#length| |ldv_arvo_init_specials_#t~mem15.base|)) (= |ldv_arvo_init_specials_#t~mem15.offset| 0))] [2018-02-02 10:21:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:51,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:21:51,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:21:51,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:21:51,404 INFO L87 Difference]: Start difference. First operand 167 states and 181 transitions. Second operand 26 states. [2018-02-02 10:21:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:52,984 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-02 10:21:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:21:52,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-02-02 10:21:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:52,985 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:21:52,985 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:21:52,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:21:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:21:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2018-02-02 10:21:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:21:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-02-02 10:21:52,988 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 48 [2018-02-02 10:21:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:52,988 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-02-02 10:21:52,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:21:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-02-02 10:21:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:21:52,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:52,989 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:52,989 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -411236025, now seen corresponding path program 1 times [2018-02-02 10:21:52,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:52,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:53,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:21:53,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,072 INFO L182 omatonBuilderFactory]: Interpolants [9824#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base)), 9825#(= 1 (select |#valid| |ldv_hid_set_drvdata_#in~hdev.base|)), 9826#(= 1 (select |#valid| ldv_hid_set_drvdata_~hdev.base)), 9827#(= 1 (select |#valid| |ldv_dev_set_drvdata_#in~dev.base|)), 9828#(= 1 (select |#valid| ldv_dev_set_drvdata_~dev.base)), 9818#true, 9819#false, 9820#(= 1 (select |#valid| entry_point_~hdev~0.base)), 9821#(= 1 (select |#valid| |ldv_arvo_probe_#in~hdev.base|)), 9822#(= 1 (select |#valid| ldv_arvo_probe_~hdev.base)), 9823#(= 1 (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|))] [2018-02-02 10:21:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:21:53,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:21:53,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:53,073 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 11 states. [2018-02-02 10:21:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,398 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-02-02 10:21:53,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:21:53,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 10:21:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,399 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:21:53,399 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:21:53,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:21:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:21:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-02-02 10:21:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:21:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-02-02 10:21:53,401 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 54 [2018-02-02 10:21:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,401 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-02-02 10:21:53,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:21:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-02-02 10:21:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:21:53,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,402 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,402 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash -411236024, now seen corresponding path program 1 times [2018-02-02 10:21:53,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:53,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:53,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:21:53,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:53,580 INFO L182 omatonBuilderFactory]: Interpolants [10193#true, 10194#false, 10195#(= 0 |ldv_malloc_#t~malloc2.offset|), 10196#(= 0 |ldv_malloc_#res.offset|), 10197#(= 0 |entry_point_#t~ret24.offset|), 10198#(= 0 entry_point_~hdev~0.offset), 10199#(= 0 |ldv_arvo_probe_#in~hdev.offset|), 10200#(= 0 ldv_arvo_probe_~hdev.offset), 10201#(= 0 |ldv_arvo_init_specials_#in~hdev.offset|), 10202#(= ldv_arvo_init_specials_~hdev.offset 0), 10203#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0)), 10204#(and (= 0 |ldv_hid_set_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_set_drvdata_#in~hdev.base|))), 10205#(and (= 0 ldv_hid_set_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_set_drvdata_~hdev.base))), 10206#(and (= 0 |ldv_dev_set_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_set_drvdata_#in~dev.base|))), 10207#(and (= ldv_dev_set_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_set_drvdata_~dev.base)))] [2018-02-02 10:21:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:53,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:21:53,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:21:53,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:21:53,581 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 15 states. [2018-02-02 10:21:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,791 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-02-02 10:21:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:21:53,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 10:21:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,791 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:21:53,792 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:21:53,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:21:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:21:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-02-02 10:21:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:21:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 10:21:53,795 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 54 [2018-02-02 10:21:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,795 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 10:21:53,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:21:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 10:21:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:21:53,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,796 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,796 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -473136990, now seen corresponding path program 1 times [2018-02-02 10:21:53,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:53,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:21:53,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,864 INFO L182 omatonBuilderFactory]: Interpolants [10576#(= 1 (select |#valid| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)), 10577#(= 1 (select |#valid| ldv_arvo_init_arvo_device_struct_~arvo.base)), 10570#true, 10571#false, 10572#(= 1 (select |#valid| |ldv_zalloc_#t~malloc3.base|)), 10573#(= 1 (select |#valid| |ldv_zalloc_#res.base|)), 10574#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~ret17.base|)), 10575#(= 1 (select |#valid| ldv_arvo_init_specials_~arvo~0.base))] [2018-02-02 10:21:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:53,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:21:53,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:21:53,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:53,865 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 8 states. [2018-02-02 10:21:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:53,981 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2018-02-02 10:21:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:53,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-02-02 10:21:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:53,982 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:21:53,982 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:21:53,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:21:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-02 10:21:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:21:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-02 10:21:53,985 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 65 [2018-02-02 10:21:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:53,985 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-02 10:21:53,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:21:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-02 10:21:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:21:53,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:53,986 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:53,987 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash -473136989, now seen corresponding path program 1 times [2018-02-02 10:21:53,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:53,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:54,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:21:54,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,183 INFO L182 omatonBuilderFactory]: Interpolants [10928#(and (= 0 |ldv_zalloc_#t~malloc3.offset|) (or (<= |ldv_zalloc_#in~size| (select |#length| |ldv_zalloc_#t~malloc3.base|)) (<= 2147483648 |ldv_zalloc_#in~size|) (<= (+ |ldv_zalloc_#in~size| 1) 0))), 10929#(and (= 0 |ldv_zalloc_#res.offset|) (or (<= 2147483648 |ldv_zalloc_#in~size|) (<= (+ |ldv_zalloc_#in~size| 1) 0) (<= |ldv_zalloc_#in~size| (select |#length| |ldv_zalloc_#res.base|)))), 10930#(and (<= 12 (select |#length| |ldv_arvo_init_specials_#t~ret17.base|)) (= 0 |ldv_arvo_init_specials_#t~ret17.offset|)), 10931#(and (<= 12 (select |#length| ldv_arvo_init_specials_~arvo~0.base)) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 10932#(and (= 0 |ldv_arvo_init_arvo_device_struct_#in~arvo.offset|) (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|))), 10933#(and (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0) (<= 12 (select |#length| ldv_arvo_init_arvo_device_struct_~arvo.base))), 10924#true, 10925#false, 10926#(and (or (<= |ldv_zalloc_#in~size| ldv_zalloc_~size) (< 0 (div ldv_zalloc_~size 4294967296))) (or (<= ldv_zalloc_~size |ldv_zalloc_#in~size|) (<= (+ (div ldv_zalloc_~size 4294967296) 1) 0))), 10927#(and (or (<= (div ldv_zalloc_~size 4294967296) 0) (<= (* 4294967296 (div ldv_zalloc_~size 4294967296)) |ldv_zalloc_#in~size|)) (or (<= (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483648) |ldv_zalloc_#in~size|) (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (<= (+ (div ldv_zalloc_~size 4294967296) 1) 0)) (= 0 |ldv_zalloc_#t~malloc3.offset|) (or (and (<= |ldv_zalloc_#in~size| ldv_zalloc_~size) (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|)))))) (< 0 (div ldv_zalloc_~size 4294967296))))] [2018-02-02 10:21:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:21:54,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:21:54,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:54,184 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 10 states. [2018-02-02 10:21:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:54,432 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-02-02 10:21:54,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:54,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:21:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:54,433 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:21:54,433 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:21:54,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:21:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-02-02 10:21:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:21:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 10:21:54,436 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 65 [2018-02-02 10:21:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:54,436 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 10:21:54,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:21:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 10:21:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:21:54,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:54,437 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:54,437 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -288623325, now seen corresponding path program 1 times [2018-02-02 10:21:54,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:54,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:54,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:21:54,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,502 INFO L182 omatonBuilderFactory]: Interpolants [11274#true, 11275#false, 11276#(= 0 |ldv_arvo_probe_#res|), 11277#(= |entry_point_#t~ret33| 0)] [2018-02-02 10:21:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:21:54,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:21:54,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:21:54,503 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-02-02 10:21:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:54,509 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-02 10:21:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:21:54,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-02-02 10:21:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:54,511 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:21:54,511 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:21:54,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:21:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:21:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 10:21:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:21:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 10:21:54,515 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 69 [2018-02-02 10:21:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:54,516 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 10:21:54,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:21:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 10:21:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:21:54,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:54,517 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:54,517 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -804539978, now seen corresponding path program 1 times [2018-02-02 10:21:54,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:54,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:54,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:54,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,561 INFO L182 omatonBuilderFactory]: Interpolants [11626#true, 11627#false, 11628#(= 0 |ldv_arvo_init_specials_#res|), 11629#(= 0 |ldv_arvo_probe_#t~ret23|), 11630#(= ldv_arvo_probe_~retval~1 0)] [2018-02-02 10:21:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:21:54,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:21:54,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:54,562 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 5 states. [2018-02-02 10:21:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:54,575 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-02-02 10:21:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:21:54,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 10:21:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:54,577 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:21:54,578 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:21:54,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:21:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:21:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 10:21:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:21:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-02 10:21:54,581 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 70 [2018-02-02 10:21:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:54,581 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-02 10:21:54,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:21:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-02 10:21:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:21:54,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:54,582 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:54,582 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 172589229, now seen corresponding path program 1 times [2018-02-02 10:21:54,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:54,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:54,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:21:54,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,675 INFO L182 omatonBuilderFactory]: Interpolants [11987#true, 11988#false, 11989#(= 1 (select |#valid| entry_point_~hdev~0.base)), 11990#(= |#valid| |old(#valid)|), 11991#(= 1 (select |#valid| |ldv_arvo_remove_#in~hdev.base|)), 11992#(= 1 (select |#valid| ldv_arvo_remove_~hdev.base)), 11993#(= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|)), 11994#(= 1 (select |#valid| lvd_arvo_remove_specials_~hdev.base))] [2018-02-02 10:21:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:54,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:21:54,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:21:54,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:21:54,675 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 8 states. [2018-02-02 10:21:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:54,929 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2018-02-02 10:21:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:21:54,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-02-02 10:21:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:54,930 INFO L225 Difference]: With dead ends: 213 [2018-02-02 10:21:54,930 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 10:21:54,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:21:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 10:21:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2018-02-02 10:21:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:21:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2018-02-02 10:21:54,934 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 72 [2018-02-02 10:21:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:54,934 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2018-02-02 10:21:54,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:21:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2018-02-02 10:21:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:21:54,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:54,935 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:54,935 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 172589230, now seen corresponding path program 1 times [2018-02-02 10:21:54,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:54,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:55,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:21:55,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,154 INFO L182 omatonBuilderFactory]: Interpolants [12417#true, 12418#false, 12419#(= 0 |ldv_malloc_#t~malloc2.offset|), 12420#(= 0 |ldv_malloc_#res.offset|), 12421#(= 0 |entry_point_#t~ret24.offset|), 12422#(= 0 entry_point_~hdev~0.offset), 12423#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 12424#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 12425#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 12426#(or (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 12427#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|))), 12428#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 12429#(and (<= 12 (select |#length| |ldv_arvo_remove_#in~hdev.base|)) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 12430#(and (= 0 ldv_arvo_remove_~hdev.offset) (<= 12 (select |#length| ldv_arvo_remove_~hdev.base))), 12431#(and (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 12 (select |#length| |lvd_arvo_remove_specials_#in~hdev.base|))), 12432#(and (= lvd_arvo_remove_specials_~hdev.offset 0) (<= 12 (select |#length| lvd_arvo_remove_specials_~hdev.base)))] [2018-02-02 10:21:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:21:55,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:21:55,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:21:55,155 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand 16 states. [2018-02-02 10:21:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:55,448 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-02 10:21:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:21:55,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 10:21:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:55,449 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:21:55,449 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 10:21:55,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:21:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 10:21:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2018-02-02 10:21:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:21:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-02 10:21:55,453 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 72 [2018-02-02 10:21:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:55,454 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-02 10:21:55,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:21:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-02 10:21:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:21:55,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:55,454 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:55,456 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1645476210, now seen corresponding path program 1 times [2018-02-02 10:21:55,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:55,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:55,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:21:55,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,883 INFO L182 omatonBuilderFactory]: Interpolants [12872#true, 12873#false, 12874#(= 0 |ldv_malloc_#t~malloc2.offset|), 12875#(= 0 |ldv_malloc_#res.offset|), 12876#(= 0 |entry_point_#t~ret24.offset|), 12877#(= 0 entry_point_~hdev~0.offset), 12878#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 12879#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 0 entry_point_~hdev~0.offset)), 12880#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12881#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 12882#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12883#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12884#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 12885#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12886#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 12887#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))), 12888#(and (= |#valid| |old(#valid)|) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4))), 12889#(and (= |#valid| |old(#valid)|) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|))), 12890#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 12891#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))))), 12892#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 12893#(and (= lvd_arvo_remove_specials_~hdev.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))))), 12894#(= 1 (select |#valid| |lvd_arvo_remove_specials_#t~mem19.base|)), 12895#(= 1 (select |#valid| lvd_arvo_remove_specials_~intf~1.base))] [2018-02-02 10:21:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:55,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:21:55,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:21:55,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:21:55,883 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 24 states. [2018-02-02 10:21:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:56,698 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-02-02 10:21:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:21:56,698 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-02-02 10:21:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:56,699 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:21:56,699 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:21:56,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:21:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:21:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2018-02-02 10:21:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:21:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 226 transitions. [2018-02-02 10:21:56,701 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 226 transitions. Word has length 74 [2018-02-02 10:21:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:56,701 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 226 transitions. [2018-02-02 10:21:56,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:21:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2018-02-02 10:21:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:21:56,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:56,702 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:56,702 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:56,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1645476209, now seen corresponding path program 1 times [2018-02-02 10:21:56,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:56,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:57,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:57,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:21:57,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:57,505 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13377#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13378#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13379#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13380#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 13381#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))), 13382#(and (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= |old(#length)| |#length|)), 13383#(and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= |old(#length)| |#length|)), 13384#(and (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))) (= 0 |ldv_arvo_remove_#in~hdev.offset|) (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))))), 13385#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8))) (= 0 ldv_arvo_remove_~hdev.offset) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))))), 13386#(and (<= (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))), 13387#(and (<= 8 (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)))) (= lvd_arvo_remove_specials_~hdev.offset 0)), 13388#(and (<= 8 |lvd_arvo_remove_specials_#t~mem19.offset|) (<= |lvd_arvo_remove_specials_#t~mem19.offset| (select |#length| |lvd_arvo_remove_specials_#t~mem19.base|))), 13389#(and (<= (+ lvd_arvo_remove_specials_~intf~1.offset 8) (select |#length| lvd_arvo_remove_specials_~intf~1.base)) (<= 0 lvd_arvo_remove_specials_~intf~1.offset)), 13363#true, 13364#false, 13365#(= 0 |ldv_malloc_#t~malloc2.offset|), 13366#(= 0 |ldv_malloc_#res.offset|), 13367#(= 0 |entry_point_#t~ret24.offset|), 13368#(= 0 entry_point_~hdev~0.offset), 13369#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 13370#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 13371#(and (= entry_point_~hdev~0.offset 0) (= entry_point_~intf~2.offset 0)), 13372#(and (<= (+ entry_point_~intf~2.offset 8) (select |#length| entry_point_~intf~2.base)) (= entry_point_~hdev~0.offset 0) (= entry_point_~intf~2.offset 0)), 13373#(and (= entry_point_~hdev~0.offset 0) (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))))), 13374#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13375#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |old(#length)| |#length|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:21:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:21:57,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:21:57,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:21:57,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:21:57,506 INFO L87 Difference]: Start difference. First operand 206 states and 226 transitions. Second operand 27 states. [2018-02-02 10:21:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:58,795 INFO L93 Difference]: Finished difference Result 241 states and 260 transitions. [2018-02-02 10:21:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:21:58,795 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 74 [2018-02-02 10:21:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:58,797 INFO L225 Difference]: With dead ends: 241 [2018-02-02 10:21:58,797 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 10:21:58,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:21:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 10:21:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 206. [2018-02-02 10:21:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:21:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 225 transitions. [2018-02-02 10:21:58,801 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 225 transitions. Word has length 74 [2018-02-02 10:21:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:58,801 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 225 transitions. [2018-02-02 10:21:58,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:21:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 225 transitions. [2018-02-02 10:21:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:21:58,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:58,802 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:21:58,802 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:21:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 529845023, now seen corresponding path program 1 times [2018-02-02 10:21:58,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:58,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:59,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:59,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:21:59,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:59,825 INFO L182 omatonBuilderFactory]: Interpolants [13888#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13889#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13890#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13891#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13892#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13893#(or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 13894#(or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|)) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 13895#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (= |#valid| |old(#valid)|) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 13896#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)))), 13897#(and (= entry_point_~hdev~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4))))), 13898#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 13899#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_remove_~hdev.offset)), 13900#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 13901#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)))) (= lvd_arvo_remove_specials_~hdev.offset 0)), 13902#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)))), 13903#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)))), 13904#(= 1 (select |#valid| |lvd_arvo_remove_specials_#t~mem20.base|)), 13871#true, 13872#false, 13873#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 13874#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 13875#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 13876#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 13877#(= |#valid| |old(#valid)|), 13878#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 13879#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 13880#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 13881#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13882#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13883#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13884#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13885#(and (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13886#(and (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 13887#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:21:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:21:59,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:21:59,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:21:59,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:21:59,825 INFO L87 Difference]: Start difference. First operand 206 states and 225 transitions. Second operand 34 states. [2018-02-02 10:22:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:02,118 INFO L93 Difference]: Finished difference Result 231 states and 250 transitions. [2018-02-02 10:22:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:22:02,119 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-02-02 10:22:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:02,120 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:22:02,120 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 10:22:02,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=358, Invalid=3064, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:22:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 10:22:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2018-02-02 10:22:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:22:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2018-02-02 10:22:02,124 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 75 [2018-02-02 10:22:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:02,124 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2018-02-02 10:22:02,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:22:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2018-02-02 10:22:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:22:02,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:02,125 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:02,125 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash 529845024, now seen corresponding path program 1 times [2018-02-02 10:22:02,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:02,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:03,177 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 51 DAG size of output 42 [2018-02-02 10:22:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:04,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:04,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:22:04,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:04,064 INFO L182 omatonBuilderFactory]: Interpolants [14400#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 14401#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 14402#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 14403#(and (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (= 0 entry_point_~hdev~0.offset) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) 8)), 14404#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14405#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14406#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0)))), 14407#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (or (and (= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) |ldv_arvo_init_specials_#t~mem14.offset|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) |ldv_arvo_init_specials_#t~mem14.base|)) (not (= ldv_arvo_init_specials_~hdev.offset 0)))), 14408#(and (or (and (or (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~intf~0.base (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))))) (+ ldv_arvo_init_specials_~intf~0.offset 8)) (<= (+ ldv_arvo_init_specials_~intf~0.offset 8) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7))) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14409#(and (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |ldv_arvo_init_specials_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#t~mem15.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) 8)) 4)))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14410#(and (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4)) 7)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) 8)) 4))))) (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7)))) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14411#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14412#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14413#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 14414#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 14415#(or (= (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))))) |ldv_arvo_init_specials_#in~hdev.base|) (<= 9 (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))) (<= (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)) 7) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))) 8)) 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 7)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)))), 14416#(or (= (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))))) |ldv_arvo_probe_#in~hdev.base|) (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)) 7) (<= 9 (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))) 8)) 4)))) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)))), 14417#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= entry_point_~hdev~0.offset 0)), 14418#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4)) 7)) (= 0 |ldv_arvo_remove_#in~hdev.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4))))), 14419#(and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)))) (= 0 ldv_arvo_remove_~hdev.offset) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)) 7))), 14420#(and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)) 7)) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 14421#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)) 7)) (= lvd_arvo_remove_specials_~hdev.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4))))), 14422#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4))))), 14423#(and (<= (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)) 7))), 14424#(and (<= 0 (+ |lvd_arvo_remove_specials_#t~mem20.offset| 7)) (<= (+ |lvd_arvo_remove_specials_#t~mem20.offset| 8) (select |#length| |lvd_arvo_remove_specials_#t~mem20.base|))), 14392#true, 14393#false, 14394#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 14395#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 14396#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 14397#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 14398#(= |#valid| |old(#valid)|), 14399#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))] [2018-02-02 10:22:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:04,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:22:04,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:22:04,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:22:04,065 INFO L87 Difference]: Start difference. First operand 206 states and 224 transitions. Second operand 33 states. [2018-02-02 10:22:04,985 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-02-02 10:22:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:07,275 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2018-02-02 10:22:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:22:07,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2018-02-02 10:22:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:07,276 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:22:07,277 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:22:07,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=407, Invalid=4149, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:22:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:22:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 206. [2018-02-02 10:22:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:22:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-02 10:22:07,280 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 75 [2018-02-02 10:22:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:07,280 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-02 10:22:07,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:22:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-02 10:22:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:22:07,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:07,280 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:07,280 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash -90629135, now seen corresponding path program 1 times [2018-02-02 10:22:07,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:07,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:07,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:22:07,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,333 INFO L182 omatonBuilderFactory]: Interpolants [14962#true, 14963#false, 14964#(not (= |ldv_zalloc_#t~malloc3.base| 0)), 14965#(not (= |ldv_zalloc_#res.base| 0)), 14966#(not (= |ldv_arvo_init_specials_#t~ret17.base| 0)), 14967#(not (= ldv_arvo_init_specials_~arvo~0.base 0))] [2018-02-02 10:22:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:22:07,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:22:07,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:22:07,334 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 6 states. [2018-02-02 10:22:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:07,348 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-02 10:22:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:22:07,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-02-02 10:22:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:07,350 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:22:07,350 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:22:07,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:22:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-02-02 10:22:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:22:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2018-02-02 10:22:07,353 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 73 [2018-02-02 10:22:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:07,354 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2018-02-02 10:22:07,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:22:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2018-02-02 10:22:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:22:07,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:07,355 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:07,355 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 217510894, now seen corresponding path program 1 times [2018-02-02 10:22:07,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:07,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:07,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:22:07,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,405 INFO L182 omatonBuilderFactory]: Interpolants [15364#true, 15365#false, 15366#(= 1 (select |#valid| lvd_arvo_remove_specials_~hdev.base)), 15367#(= 1 (select |#valid| |ldv_hid_get_drvdata_#in~hdev.base|)), 15368#(= 1 (select |#valid| ldv_hid_get_drvdata_~hdev.base)), 15369#(= 1 (select |#valid| |ldv_dev_get_drvdata_#in~dev.base|)), 15370#(= 1 (select |#valid| ldv_dev_get_drvdata_~dev.base))] [2018-02-02 10:22:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:07,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:07,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:07,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:07,406 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand 7 states. [2018-02-02 10:22:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:07,497 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-02-02 10:22:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:07,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-02-02 10:22:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:07,498 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:22:07,498 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 10:22:07,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:22:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 10:22:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-02-02 10:22:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 10:22:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-02 10:22:07,500 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 81 [2018-02-02 10:22:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:07,500 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-02 10:22:07,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-02 10:22:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:22:07,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:07,501 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:07,501 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash 217510895, now seen corresponding path program 1 times [2018-02-02 10:22:07,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:07,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:07,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:07,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:07,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:07,741 INFO L182 omatonBuilderFactory]: Interpolants [15776#(or (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 15777#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|))), 15778#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 15779#(and (<= 12 (select |#length| |ldv_arvo_remove_#in~hdev.base|)) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 15780#(and (= 0 ldv_arvo_remove_~hdev.offset) (<= 12 (select |#length| ldv_arvo_remove_~hdev.base))), 15781#(and (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 12 (select |#length| |lvd_arvo_remove_specials_#in~hdev.base|))), 15782#(and (<= 12 (select |#length| lvd_arvo_remove_specials_~hdev.base)) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 15783#(and (= 0 |ldv_hid_get_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_get_drvdata_#in~hdev.base|))), 15784#(and (= 0 ldv_hid_get_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_get_drvdata_~hdev.base))), 15785#(and (= 0 |ldv_dev_get_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_get_drvdata_#in~dev.base|))), 15786#(and (= ldv_dev_get_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_get_drvdata_~dev.base))), 15767#true, 15768#false, 15769#(= 0 |ldv_malloc_#t~malloc2.offset|), 15770#(= 0 |ldv_malloc_#res.offset|), 15771#(= 0 |entry_point_#t~ret24.offset|), 15772#(= 0 entry_point_~hdev~0.offset), 15773#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 15774#(and (or (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 15775#(and (or (not (= ldv_arvo_init_specials_~hdev.offset 0)) (and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0)))] [2018-02-02 10:22:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:07,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:07,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:07,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:07,742 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 20 states. [2018-02-02 10:22:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:08,053 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2018-02-02 10:22:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:08,054 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-02-02 10:22:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:08,054 INFO L225 Difference]: With dead ends: 221 [2018-02-02 10:22:08,054 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:22:08,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:22:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:22:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2018-02-02 10:22:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:22:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-02-02 10:22:08,057 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 81 [2018-02-02 10:22:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:08,057 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-02-02 10:22:08,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-02-02 10:22:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:22:08,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:08,058 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:08,058 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 790903974, now seen corresponding path program 1 times [2018-02-02 10:22:08,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:08,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:08,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:08,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:22:08,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:08,541 INFO L182 omatonBuilderFactory]: Interpolants [16226#true, 16227#false, 16228#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 16229#(= (select |#valid| |ldv_malloc_#res.base|) 1), 16230#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 16231#(= (select |#valid| entry_point_~hdev~0.base) 1), 16232#(= |#valid| |old(#valid)|), 16233#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16234#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16235#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 16236#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16237#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16238#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 16239#(and (= 0 |entry_point_#t~ret26.offset|) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16240#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16241#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16242#(and (= 0 (select (select (store |#memory_$Pointer$.offset| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) (+ entry_point_~intf~2.offset 8))) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16243#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 16244#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16245#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16246#(and (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16247#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16248#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 16249#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 16250#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 16251#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 16252#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))), 16253#(= |entry_point_#t~mem34.offset| 0)] [2018-02-02 10:22:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:08,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:22:08,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:22:08,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:22:08,542 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 28 states. [2018-02-02 10:22:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:09,593 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 10:22:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:22:09,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 82 [2018-02-02 10:22:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:09,594 INFO L225 Difference]: With dead ends: 229 [2018-02-02 10:22:09,594 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 10:22:09,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=2361, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:22:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 10:22:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 209. [2018-02-02 10:22:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:22:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 224 transitions. [2018-02-02 10:22:09,598 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 224 transitions. Word has length 82 [2018-02-02 10:22:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:09,598 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 224 transitions. [2018-02-02 10:22:09,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:22:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2018-02-02 10:22:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:22:09,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:09,599 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:09,599 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 790903975, now seen corresponding path program 1 times [2018-02-02 10:22:09,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:09,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:10,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:10,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 10:22:10,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:10,047 INFO L182 omatonBuilderFactory]: Interpolants [16741#true, 16742#false, 16743#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 16744#(= (select |#valid| |ldv_malloc_#res.base|) 1), 16745#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 16746#(= (select |#valid| entry_point_~hdev~0.base) 1), 16747#(= |#valid| |old(#valid)|), 16748#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16749#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16750#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 16751#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16752#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16753#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16754#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16755#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16756#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16757#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16758#(and (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16759#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16760#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 16761#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16762#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 16763#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 16764#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 16765#(and (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 16766#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 16767#(= 1 (select |#valid| |entry_point_#t~mem34.base|))] [2018-02-02 10:22:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:22:10,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:22:10,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:22:10,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:22:10,048 INFO L87 Difference]: Start difference. First operand 209 states and 224 transitions. Second operand 27 states. [2018-02-02 10:22:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:10,868 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-02-02 10:22:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:22:10,868 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-02-02 10:22:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:10,869 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:22:10,869 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:22:10,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:22:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:22:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 210. [2018-02-02 10:22:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 10:22:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-02 10:22:10,872 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 82 [2018-02-02 10:22:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:10,872 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-02 10:22:10,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:22:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-02 10:22:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:22:10,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:10,872 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:10,872 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1859667754, now seen corresponding path program 1 times [2018-02-02 10:22:10,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:10,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:10,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:10,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:22:10,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:10,910 INFO L182 omatonBuilderFactory]: Interpolants [17232#(not (= |ldv_arvo_init_arvo_device_struct_#t~ret13| 0)), 17233#(not (= |ldv_arvo_init_arvo_device_struct_#res| 0)), 17234#(not (= |ldv_arvo_init_specials_#t~ret18| 0)), 17235#(not (= ldv_arvo_init_specials_~retval~0 0)), 17229#true, 17230#false, 17231#(not (= |ldv_nonpositive_#res| 0))] [2018-02-02 10:22:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:10,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:22:10,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:22:10,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:10,911 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 7 states. [2018-02-02 10:22:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:10,922 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 10:22:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:22:10,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-02-02 10:22:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:10,923 INFO L225 Difference]: With dead ends: 217 [2018-02-02 10:22:10,923 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:22:10,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:22:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:22:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 10:22:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:22:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 10:22:10,926 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 85 [2018-02-02 10:22:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:10,926 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 10:22:10,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:22:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 10:22:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:22:10,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:10,927 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:10,927 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2141896535, now seen corresponding path program 1 times [2018-02-02 10:22:10,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:10,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:11,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:11,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:22:11,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:11,073 INFO L182 omatonBuilderFactory]: Interpolants [17680#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0))), 17670#true, 17671#false, 17672#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 17673#(= |#Ultimate.meminit_#t~loopctr35| 0), 17674#(<= |#Ultimate.meminit_#product| 0), 17675#(and (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 0) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 17676#(and (<= (select |#length| |ldv_zalloc_#res.base|) 0) (= 0 |ldv_zalloc_#res.offset|)), 17677#(and (= 0 |ldv_arvo_init_specials_#t~ret17.offset|) (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 0)), 17678#(and (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 0) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 17679#(and (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)))] [2018-02-02 10:22:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:11,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:22:11,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:22:11,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:22:11,074 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-02 10:22:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:11,372 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2018-02-02 10:22:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:11,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-02-02 10:22:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:11,373 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:22:11,374 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:22:11,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:22:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:22:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 10:22:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:22:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 10:22:11,377 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 85 [2018-02-02 10:22:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:11,378 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 10:22:11,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:22:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 10:22:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:22:11,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:11,379 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:11,379 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -150489879, now seen corresponding path program 1 times [2018-02-02 10:22:11,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:11,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:11,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:11,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:22:11,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:11,801 INFO L182 omatonBuilderFactory]: Interpolants [18133#true, 18134#false, 18135#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 18136#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 18137#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 18138#(= 1 (select |#valid| entry_point_~hdev~0.base)), 18139#(= |#valid| |old(#valid)|), 18140#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 18141#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 18142#(and (= 1 (select |#valid| |entry_point_#t~ret25.base|)) (not (= |entry_point_#t~ret25.base| entry_point_~hdev~0.base))), 18143#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18144#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 18145#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 18146#(and (not (= |entry_point_#t~ret26.base| 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 18147#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18148#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18149#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18150#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 18151#(and (= |ldv_arvo_init_specials_#in~hdev.base| ldv_arvo_init_specials_~hdev.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18152#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18153#(and (= |ldv_hid_set_drvdata_#in~hdev.base| ldv_hid_set_drvdata_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18154#(and (= |ldv_dev_set_drvdata_#in~dev.base| ldv_dev_set_drvdata_~dev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18155#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18156#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18157#(and (= |#valid| |old(#valid)|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 18158#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18159#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| entry_point_~intf~2.base))), 18160#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem34.base|)) (= 1 (select |#valid| entry_point_~intf~2.base))), 18161#(= 1 (select |#valid| entry_point_~intf~2.base))] [2018-02-02 10:22:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:11,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:22:11,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:22:11,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:22:11,801 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 29 states. [2018-02-02 10:22:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:12,569 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-02-02 10:22:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:22:12,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-02-02 10:22:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:12,569 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:22:12,569 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:22:12,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:22:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:22:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 10:22:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:22:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-02 10:22:12,572 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 84 [2018-02-02 10:22:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:12,572 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-02 10:22:12,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:22:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-02 10:22:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:22:12,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:12,573 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:12,573 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 997359006, now seen corresponding path program 1 times [2018-02-02 10:22:12,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:12,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 10:22:12,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:22:12,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:22:12,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:22:12,636 INFO L182 omatonBuilderFactory]: Interpolants [18640#(= 1 (select |#valid| |ldv_dev_set_drvdata_#in~dev.base|)), 18641#(= 1 (select |#valid| ldv_dev_set_drvdata_~dev.base)), 18632#true, 18633#false, 18634#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base)), 18635#(= |#valid| |old(#valid)|), 18636#(and (= (store |old(#valid)| |ldv_zalloc_#t~malloc3.base| (select |#valid| |ldv_zalloc_#t~malloc3.base|)) |#valid|) (= 1 (select |#valid| |ldv_zalloc_#t~malloc3.base|))), 18637#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 18638#(= 1 (select |#valid| |ldv_hid_set_drvdata_#in~hdev.base|)), 18639#(= 1 (select |#valid| ldv_hid_set_drvdata_~hdev.base))] [2018-02-02 10:22:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 10:22:12,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:22:12,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:22:12,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:22:12,636 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 10 states. [2018-02-02 10:22:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:13,048 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-02-02 10:22:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:22:13,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-02 10:22:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:13,049 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:22:13,049 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:22:13,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:22:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:22:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 10:22:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:22:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 10:22:13,053 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 86 [2018-02-02 10:22:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:13,054 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 10:22:13,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:22:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 10:22:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:22:13,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:13,054 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:13,055 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash 997359007, now seen corresponding path program 1 times [2018-02-02 10:22:13,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:13,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:22:13,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:13,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:22:13,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:13,304 INFO L182 omatonBuilderFactory]: Interpolants [19104#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 19105#(and (= 0 (select |old(#valid)| |ldv_zalloc_#t~malloc3.base|)) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc3.base| (select |#length| |ldv_zalloc_#t~malloc3.base|)))), 19106#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 19107#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0)), 19108#(and (= 0 |ldv_hid_set_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_set_drvdata_#in~hdev.base|))), 19109#(and (= 0 ldv_hid_set_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_set_drvdata_~hdev.base))), 19110#(and (= 0 |ldv_dev_set_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_set_drvdata_#in~dev.base|))), 19111#(and (= ldv_dev_set_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_set_drvdata_~dev.base))), 19092#true, 19093#false, 19094#(= 0 |ldv_malloc_#t~malloc2.offset|), 19095#(= 0 |ldv_malloc_#res.offset|), 19096#(= 0 |entry_point_#t~ret24.offset|), 19097#(= 0 entry_point_~hdev~0.offset), 19098#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 19099#(and (= (select |#valid| |ldv_arvo_probe_#in~hdev.base|) 1) (= 0 |ldv_arvo_probe_#in~hdev.offset|)), 19100#(and (= (select |#valid| ldv_arvo_probe_~hdev.base) 1) (= 0 ldv_arvo_probe_~hdev.offset)), 19101#(and (= (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|) 1) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 19102#(and (= ldv_arvo_init_specials_~hdev.offset 0) (= (select |#valid| ldv_arvo_init_specials_~hdev.base) 1)), 19103#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0) (= (select |#valid| ldv_arvo_init_specials_~hdev.base) 1))] [2018-02-02 10:22:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:22:13,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:22:13,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:22:13,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:22:13,305 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 20 states. [2018-02-02 10:22:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:14,010 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-02 10:22:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:22:14,011 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-02-02 10:22:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:14,012 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:22:14,012 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:22:14,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:22:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:22:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 10:22:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:22:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 10:22:14,016 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 86 [2018-02-02 10:22:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:14,017 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 10:22:14,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:22:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 10:22:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:22:14,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:14,018 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:14,018 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash -370218899, now seen corresponding path program 1 times [2018-02-02 10:22:14,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:14,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:14,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:14,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:22:14,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:14,709 INFO L182 omatonBuilderFactory]: Interpolants [19584#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 19585#(and (not (= |entry_point_#t~ret25.base| 0)) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19586#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19587#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 19588#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 19589#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 19590#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19591#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19592#(and (not (= (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19593#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 19594#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 19595#(and (= |ldv_arvo_init_specials_#in~hdev.base| ldv_arvo_init_specials_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19596#(and (= |ldv_hid_set_drvdata_#in~hdev.base| ldv_hid_set_drvdata_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19597#(and (= |ldv_dev_set_drvdata_#in~dev.base| ldv_dev_set_drvdata_~dev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19598#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19599#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19600#(and (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 19601#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19602#(= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base), 19603#(= lvd_arvo_remove_specials_~hdev.base |lvd_arvo_remove_specials_#in~hdev.base|), 19604#(= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|)), 19605#(= 1 (select |#valid| |ldv_arvo_remove_#in~hdev.base|)), 19606#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19607#(and (= 1 (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base)) (not (= |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19608#(and (= 1 (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)) (not (= 0 entry_point_~intf~2.base))), 19576#true, 19577#false, 19578#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 19579#(= (select |#valid| |ldv_malloc_#res.base|) 1), 19580#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 19581#(= 1 (select |#valid| entry_point_~hdev~0.base)), 19582#(= |#valid| |old(#valid)|), 19583#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))] [2018-02-02 10:22:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:14,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:22:14,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:22:14,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:22:14,709 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 33 states. [2018-02-02 10:22:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:16,205 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-02-02 10:22:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:22:16,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-02-02 10:22:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:16,206 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:22:16,206 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:22:16,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=429, Invalid=3477, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:22:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:22:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-02 10:22:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:22:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 10:22:16,209 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 85 [2018-02-02 10:22:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:16,210 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 10:22:16,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:22:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 10:22:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:22:16,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:16,210 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:16,211 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1590719605, now seen corresponding path program 1 times [2018-02-02 10:22:16,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:16,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:16,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:16,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:22:16,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:16,690 INFO L182 omatonBuilderFactory]: Interpolants [20122#true, 20123#false, 20124#(= 0 |ldv_malloc_#t~malloc2.offset|), 20125#(= 0 |ldv_malloc_#res.offset|), 20126#(= 0 |entry_point_#t~ret24.offset|), 20127#(= 0 entry_point_~hdev~0.offset), 20128#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 20129#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 20130#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 20131#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 20132#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= ldv_hid_set_drvdata_~data.offset |ldv_hid_set_drvdata_#in~data.offset|)), 20133#(and (= ldv_dev_set_drvdata_~data.offset |ldv_dev_set_drvdata_#in~data.offset|) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 20134#(or (= (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_set_drvdata_#in~data.offset|) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 20135#(or (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_set_drvdata_#in~data.offset|)), 20136#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4)))), 20137#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4)))), 20138#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ 0 4))) (= 0 entry_point_~hdev~0.offset)), 20139#(and (= 0 |ldv_arvo_remove_#in~hdev.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 4)))), 20140#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 4)))), 20141#(and (= 0 (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 4))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 20142#(and (= 0 (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ 0 4))) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 20143#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 20144#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 20145#(or (= |ldv_dev_get_drvdata_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4))) (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0))), 20146#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= |ldv_dev_get_drvdata_#res.offset| (select (select |#memory_$Pointer$.offset| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)))), 20147#(or (= |ldv_hid_get_drvdata_#t~ret6.offset| (select (select |#memory_$Pointer$.offset| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20148#(or (= |ldv_hid_get_drvdata_#res.offset| (select (select |#memory_$Pointer$.offset| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20149#(= 0 |lvd_arvo_remove_specials_#t~ret22.offset|), 20150#(= 0 lvd_arvo_remove_specials_~arvo~1.offset)] [2018-02-02 10:22:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:16,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:22:16,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:22:16,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:22:16,690 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 29 states. [2018-02-02 10:22:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:17,253 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2018-02-02 10:22:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:22:17,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-02-02 10:22:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:17,254 INFO L225 Difference]: With dead ends: 229 [2018-02-02 10:22:17,254 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 10:22:17,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:22:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 10:22:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-02 10:22:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:22:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 233 transitions. [2018-02-02 10:22:17,256 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 233 transitions. Word has length 89 [2018-02-02 10:22:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:17,257 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 233 transitions. [2018-02-02 10:22:17,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:22:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 233 transitions. [2018-02-02 10:22:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:22:17,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:17,257 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:17,257 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1590719604, now seen corresponding path program 1 times [2018-02-02 10:22:17,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:17,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:17,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:17,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:22:17,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:17,788 INFO L182 omatonBuilderFactory]: Interpolants [20627#true, 20628#false, 20629#(= 0 |ldv_malloc_#t~malloc2.offset|), 20630#(= 0 |ldv_malloc_#res.offset|), 20631#(= 0 |entry_point_#t~ret24.offset|), 20632#(= 0 entry_point_~hdev~0.offset), 20633#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 20634#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 20635#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 20636#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 20637#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 20638#(and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 20639#(or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))), 20640#(or (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 20641#(or (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 20642#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4)))), 20643#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ 0 4))) (= 0 entry_point_~hdev~0.offset)), 20644#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 4))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 20645#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 4)))), 20646#(and (= 0 (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 4))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 20647#(and (= 0 (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ 0 4))) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 20648#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 20649#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 20650#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 20651#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 20652#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 20653#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20654#(= 0 |lvd_arvo_remove_specials_#t~ret22.base|), 20655#(= lvd_arvo_remove_specials_~arvo~1.base 0)] [2018-02-02 10:22:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:17,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:22:17,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:22:17,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:22:17,789 INFO L87 Difference]: Start difference. First operand 219 states and 233 transitions. Second operand 29 states. [2018-02-02 10:22:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:18,392 INFO L93 Difference]: Finished difference Result 228 states and 239 transitions. [2018-02-02 10:22:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:22:18,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-02-02 10:22:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:18,393 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:22:18,393 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:22:18,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:22:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:22:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2018-02-02 10:22:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:22:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 232 transitions. [2018-02-02 10:22:18,397 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 232 transitions. Word has length 89 [2018-02-02 10:22:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:18,397 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 232 transitions. [2018-02-02 10:22:18,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:22:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 232 transitions. [2018-02-02 10:22:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:22:18,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:18,398 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:18,398 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash 284856192, now seen corresponding path program 1 times [2018-02-02 10:22:18,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:18,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:19,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:19,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:22:19,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:19,986 INFO L182 omatonBuilderFactory]: Interpolants [21131#true, 21132#false, 21133#(= |#valid| |old(#valid)|), 21134#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 21135#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21136#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21137#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21138#(and (not (= |entry_point_#t~ret25.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret25.base|) 0) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= 0 entry_point_~hdev~0.base)) (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= (store (store |old(#valid)| |entry_point_#t~ret25.base| (select |#valid| |entry_point_#t~ret25.base|)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 21139#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~intf~2.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21140#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 21141#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 21142#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (= (select |old(#valid)| |entry_point_#t~ret26.base|) 0) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |entry_point_#t~ret26.base| (select |#valid| |entry_point_#t~ret26.base|))) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21143#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= 0 entry_point_~intf~2.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21144#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21145#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21146#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21147#(and (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21148#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 21149#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 21150#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21151#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 21152#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 21153#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 21154#(and (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 21155#(and (= (select |old(#valid)| |entry_point_#t~mem34.base|) (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= entry_point_~intf~2.base |entry_point_#t~mem34.base|)) (not (= |entry_point_#t~mem34.base| 0)) (= (store (store (store |old(#valid)| |entry_point_#t~mem34.base| (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) entry_point_~intf~2.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~intf~2.base)) entry_point_~hdev~0.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base)) (store |#valid| |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= |entry_point_#t~mem34.base| entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 21156#(and (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) (not (= 0 entry_point_~intf~2.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base)) (= (store |#valid| entry_point_~intf~2.base 0) (store (store |old(#valid)| entry_point_~intf~2.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) entry_point_~hdev~0.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)))), 21157#(and (= (select |old(#valid)| entry_point_~hdev~0.base) (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (= (select |old(#valid)| (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))) (select (store |#valid| entry_point_~hdev~0.base 0) (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0)))) (not (= 0 entry_point_~hdev~0.base)))] [2018-02-02 10:22:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:19,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:22:19,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:22:19,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:22:19,987 INFO L87 Difference]: Start difference. First operand 219 states and 232 transitions. Second operand 27 states. [2018-02-02 10:22:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:21,418 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2018-02-02 10:22:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:22:21,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 88 [2018-02-02 10:22:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:21,419 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:22:21,419 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:22:21,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1686, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:22:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:22:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 10:22:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 10:22:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-02-02 10:22:21,422 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 88 [2018-02-02 10:22:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:21,422 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-02-02 10:22:21,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:22:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-02-02 10:22:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:22:21,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:21,422 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:21,422 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -487038867, now seen corresponding path program 1 times [2018-02-02 10:22:21,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:21,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:21,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:21,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:22:21,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:21,963 INFO L182 omatonBuilderFactory]: Interpolants [21632#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 21633#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 21634#(= |#valid| |old(#valid)|), 21635#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 21636#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 21637#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 21638#(and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 21639#(or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))), 21640#(or (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 21641#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (= |#valid| |old(#valid)|))), 21642#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))))), 21643#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ 0 4))) (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 21644#(and (= |#valid| |old(#valid)|) (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 21645#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= |lvd_arvo_remove_specials_#in~hdev.base| lvd_arvo_remove_specials_~hdev.base)), 21646#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 21647#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 21648#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 21649#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 21650#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 21651#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 21652#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= |#valid| |old(#valid)|))), 21653#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= lvd_arvo_remove_specials_~arvo~1.base (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4))))), 21654#(or (not (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) 0)) (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (= |#valid| |old(#valid)|)), 21655#(or (not (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) 0)) (= |#valid| |old(#valid)|) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 21656#(= 1 (select |#valid| entry_point_~intf~2.base)), 21624#true, 21625#false, 21626#(= 0 |ldv_malloc_#t~malloc2.offset|), 21627#(= 0 |ldv_malloc_#res.offset|), 21628#(= 0 |entry_point_#t~ret24.offset|), 21629#(= 0 entry_point_~hdev~0.offset), 21630#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 21631#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 10:22:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:22:21,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:22:21,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:22:21,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:22:21,964 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 33 states. [2018-02-02 10:22:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:22:22,922 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2018-02-02 10:22:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:22:22,922 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-02-02 10:22:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:22:22,923 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:22:22,923 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 10:22:22,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=2150, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:22:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 10:22:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-02-02 10:22:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 10:22:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-02-02 10:22:22,925 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 94 [2018-02-02 10:22:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:22:22,925 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-02-02 10:22:22,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:22:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-02-02 10:22:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:22:22,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:22:22,926 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:22:22,926 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 10:22:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2081664383, now seen corresponding path program 1 times [2018-02-02 10:22:22,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:22:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:22:22,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:22:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:24,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:22:24,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 10:22:24,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:22:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:24,135 INFO L182 omatonBuilderFactory]: Interpolants [22144#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 22145#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 22146#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 22147#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 22148#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= |#valid| |old(#valid)|))), 22149#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) lvd_arvo_remove_specials_~arvo~1.base) (= |#valid| |old(#valid)|))), 22150#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (or (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |old(#valid)| 0) 1)), 22151#(or (= (select |old(#valid)| 0) 1) (and (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 22152#(and (= entry_point_~intf~2.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 22153#(= 1 (select |#valid| |entry_point_#t~mem34.base|)), 22110#true, 22111#false, 22112#(= (select |#valid| 0) 0), 22113#(= (select |old(#valid)| 0) (select |#valid| 0)), 22114#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 22115#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22116#(and (= 0 |entry_point_#t~ret24.offset|) (= (select |#valid| 0) 0) (= 1 (select |#valid| |entry_point_#t~ret24.base|))), 22117#(and (= (select |#valid| 0) 0) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| entry_point_~hdev~0.base))), 22118#(= |#valid| |old(#valid)|), 22119#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 22120#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22121#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (= 0 (select |#valid| 0)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 22122#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 22123#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 22124#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 22125#(and (= 0 (select |#valid| 0)) (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 22126#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 22127#(and (= 0 (select |#valid| 0)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 22128#(and (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 22129#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22130#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 22131#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22132#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 22133#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 22134#(and (or (and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_dev_set_drvdata_~dev.offset 0))) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset))), 22135#(or (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 22136#(or (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (and (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 22137#(or (and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (= |#valid| |old(#valid)|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 22138#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 22139#(and (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~intf~2.offset 4))))), 22140#(and (= |#valid| |old(#valid)|) (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 22141#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= |lvd_arvo_remove_specials_#in~hdev.base| lvd_arvo_remove_specials_~hdev.base)), 22142#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 22143#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0))))] [2018-02-02 10:22:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:22:24,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 10:22:24,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 10:22:24,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:22:24,136 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 44 states. Received shutdown request... [2018-02-02 10:22:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:22:25,403 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:22:25,408 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:22:25,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:22:25 BoogieIcfgContainer [2018-02-02 10:22:25,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:22:25,409 INFO L168 Benchmark]: Toolchain (without parser) took 46042.50 ms. Allocated memory was 405.8 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 362.7 MB in the beginning and 886.3 MB in the end (delta: -523.6 MB). Peak memory consumption was 399.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:25,410 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:22:25,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.50 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 348.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:25,410 INFO L168 Benchmark]: Boogie Preprocessor took 31.72 ms. Allocated memory is still 405.8 MB. Free memory was 348.0 MB in the beginning and 345.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:25,410 INFO L168 Benchmark]: RCFGBuilder took 381.06 ms. Allocated memory is still 405.8 MB. Free memory was 345.3 MB in the beginning and 302.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:25,411 INFO L168 Benchmark]: TraceAbstraction took 45435.23 ms. Allocated memory was 405.8 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 302.1 MB in the beginning and 886.3 MB in the end (delta: -584.2 MB). Peak memory consumption was 338.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:22:25,411 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.50 ms. Allocated memory is still 405.8 MB. Free memory was 362.7 MB in the beginning and 348.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.72 ms. Allocated memory is still 405.8 MB. Free memory was 348.0 MB in the beginning and 345.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 381.06 ms. Allocated memory is still 405.8 MB. Free memory was 345.3 MB in the beginning and 302.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45435.23 ms. Allocated memory was 405.8 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 302.1 MB in the beginning and 886.3 MB in the end (delta: -584.2 MB). Peak memory consumption was 338.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (210states) and interpolant automaton (currently 29 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (76 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 173 locations, 45 error locations. TIMEOUT Result, 45.3s OverallTime, 53 OverallIterations, 3 TraceHistogramMax, 28.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7086 SDtfs, 5366 SDslu, 44934 SDs, 0 SdLazy, 45436 SolverSat, 1836 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 166 SyntacticMatches, 52 SemanticMatches, 1096 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6850 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 635/826 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 596 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 3033 NumberOfCodeBlocks, 3033 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2980 ConstructedInterpolants, 0 QuantifiedInterpolants, 1947043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 20 PerfectInterpolantSequences, 635/826 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-22-25-416.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-22-25-416.csv Completed graceful shutdown