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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 20:44:49,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 20:44:49,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 20:44:49,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 20:44:49,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 20:44:49,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 20:44:49,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 20:44:49,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 20:44:49,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 20:44:49,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 20:44:49,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 20:44:49,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 20:44:49,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 20:44:49,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 20:44:49,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 20:44:49,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 20:44:49,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 20:44:49,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 20:44:49,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 20:44:49,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 20:44:49,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 20:44:49,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 20:44:49,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 20:44:49,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 20:44:49,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 20:44:49,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 20:44:49,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 20:44:49,269 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 20:44:49,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 20:44:49,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 20:44:49,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 20:44:49,270 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-04 20:44:49,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 20:44:49,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 20:44:49,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 20:44:49,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 20:44:49,282 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 20:44:49,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 20:44:49,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 20:44:49,284 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 20:44:49,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 20:44:49,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 20:44:49,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 20:44:49,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 20:44:49,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-04 20:44:49,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:49,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 20:44:49,330 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 20:44:49,333 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 20:44:49,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 20:44:49,336 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 20:44:49,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i [2018-02-04 20:44:49,498 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 20:44:49,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 20:44:49,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 20:44:49,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 20:44:49,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 20:44:49,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce31117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49, skipping insertion in model container [2018-02-04 20:44:49,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,521 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:44:49,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 20:44:49,653 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:44:49,674 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 20:44:49,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49 WrapperNode [2018-02-04 20:44:49,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 20:44:49,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 20:44:49,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 20:44:49,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 20:44:49,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (1/1) ... [2018-02-04 20:44:49,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 20:44:49,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 20:44:49,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 20:44:49,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 20:44:49,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (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-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-02-04 20:44:49,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials_unsafe [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe_unsafe [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 20:44:49,757 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 20:44:49,757 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-02-04 20:44:49,758 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials_unsafe [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-02-04 20:44:49,758 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe_unsafe [2018-02-04 20:44:49,759 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-02-04 20:44:49,759 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 20:44:49,759 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 20:44:49,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 20:44:49,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 20:44:50,092 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 20:44:50,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:44:50 BoogieIcfgContainer [2018-02-04 20:44:50,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 20:44:50,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 20:44:50,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 20:44:50,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 20:44:50,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 08:44:49" (1/3) ... [2018-02-04 20:44:50,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9a0d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:44:50, skipping insertion in model container [2018-02-04 20:44:50,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 08:44:49" (2/3) ... [2018-02-04 20:44:50,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9a0d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 08:44:50, skipping insertion in model container [2018-02-04 20:44:50,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 08:44:50" (3/3) ... [2018-02-04 20:44:50,101 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test15_false-valid-memtrack.i [2018-02-04 20:44:50,109 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 20:44:50,116 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-04 20:44:50,148 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 20:44:50,149 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 20:44:50,149 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-04 20:44:50,149 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 20:44:50,149 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 20:44:50,149 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 20:44:50,149 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 20:44:50,149 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 20:44:50,150 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 20:44:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-02-04 20:44:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 20:44:50,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:50,173 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:50,174 INFO L371 AbstractCegarLoop]: === Iteration 1 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 462743197, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:50,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:50,396 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-04 20:44:50,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:44:50,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 20:44:50,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:50,402 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-04 20:44:50,402 INFO L182 omatonBuilderFactory]: Interpolants [208#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 168#true, 200#(not (= 0 |entry_point_#t~ret22.base|)), 169#false, 201#(not (= 0 entry_point_~hdev~0.base)), 202#(not (= 0 |ldv_zalloc_#t~malloc1.base|)), 188#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 189#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 207#(not (= 0 |ldv_zalloc_#res.base|))] [2018-02-04 20:44:50,403 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-04 20:44:50,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:44:50,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:44:50,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:44:50,413 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 9 states. [2018-02-04 20:44:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:51,096 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2018-02-04 20:44:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:44:51,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 20:44:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:51,112 INFO L225 Difference]: With dead ends: 209 [2018-02-04 20:44:51,113 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 20:44:51,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:44:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 20:44:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2018-02-04 20:44:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 20:44:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-02-04 20:44:51,225 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 22 [2018-02-04 20:44:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:51,225 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-02-04 20:44:51,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:44:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-02-04 20:44:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 20:44:51,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:51,227 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:51,227 INFO L371 AbstractCegarLoop]: === Iteration 2 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -844495449, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:51,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 20:44:51,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:44:51,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 20:44:51,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 20:44:51,357 INFO L182 omatonBuilderFactory]: Interpolants [595#true, 596#false, 628#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 629#(not (= 0 |ldv_zalloc_#t~malloc1.base|)), 634#(not (= 0 |ldv_zalloc_#res.base|)), 620#(not (= 0 |entry_point_#t~ret23.base|)), 621#(not (= 0 entry_point_~intf~2.base)), 622#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 623#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:44:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 20:44:51,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:44:51,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:44:51,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:44:51,358 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 9 states. [2018-02-04 20:44:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:51,759 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2018-02-04 20:44:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 20:44:51,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 20:44:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:51,760 INFO L225 Difference]: With dead ends: 198 [2018-02-04 20:44:51,760 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 20:44:51,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:44:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 20:44:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2018-02-04 20:44:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 20:44:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-02-04 20:44:51,769 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 33 [2018-02-04 20:44:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:51,770 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-02-04 20:44:51,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:44:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-02-04 20:44:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 20:44:51,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:51,770 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:51,771 INFO L371 AbstractCegarLoop]: === Iteration 3 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash 902320110, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:51,773 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 20:44:51,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:44:51,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 20:44:51,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 20:44:51,953 INFO L182 omatonBuilderFactory]: Interpolants [1008#true, 1009#false, 1043#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1059#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 1044#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1060#(= 0 |#Ultimate.meminit_#t~loopctr33|), 1061#(<= |#Ultimate.meminit_#product| 0), 1049#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1054#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 20:44:51,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:44:51,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:44:51,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:44:51,954 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 9 states. [2018-02-04 20:44:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:52,528 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2018-02-04 20:44:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:44:52,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-02-04 20:44:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:52,530 INFO L225 Difference]: With dead ends: 201 [2018-02-04 20:44:52,530 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 20:44:52,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:44:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 20:44:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 171. [2018-02-04 20:44:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 20:44:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2018-02-04 20:44:52,541 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 44 [2018-02-04 20:44:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:52,541 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2018-02-04 20:44:52,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:44:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2018-02-04 20:44:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 20:44:52,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:52,543 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:52,543 INFO L371 AbstractCegarLoop]: === Iteration 4 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1882350442, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:52,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 20:44:52,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:52,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 20:44:52,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:52,712 INFO L182 omatonBuilderFactory]: Interpolants [1489#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1490#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1495#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1496#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 1453#true, 1501#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 1454#false, 1502#(= 0 |#Ultimate.meminit_#t~loopctr33|), 1503#(<= |#Ultimate.meminit_#product| 0)] [2018-02-04 20:44:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 20:44:52,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:44:52,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:44:52,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:44:52,714 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand 9 states. [2018-02-04 20:44:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:53,270 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2018-02-04 20:44:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:44:53,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 20:44:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:53,271 INFO L225 Difference]: With dead ends: 204 [2018-02-04 20:44:53,272 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 20:44:53,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:44:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 20:44:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2018-02-04 20:44:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 20:44:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2018-02-04 20:44:53,277 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 45 [2018-02-04 20:44:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:53,278 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2018-02-04 20:44:53,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:44:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2018-02-04 20:44:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 20:44:53,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:53,278 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:53,278 INFO L371 AbstractCegarLoop]: === Iteration 5 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1830284766, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:53,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:53,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:53,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 20:44:53,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 20:44:53,406 INFO L182 omatonBuilderFactory]: Interpolants [1953#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 1954#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1955#(= 0 |#Ultimate.meminit_#t~loopctr33|), 1956#(<= |#Ultimate.meminit_#product| 0), 1909#true, 1910#false, 1946#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 1947#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 1948#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:53,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 20:44:53,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 20:44:53,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 20:44:53,407 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand 9 states. [2018-02-04 20:44:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:53,913 INFO L93 Difference]: Finished difference Result 191 states and 205 transitions. [2018-02-04 20:44:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 20:44:53,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-04 20:44:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:53,915 INFO L225 Difference]: With dead ends: 191 [2018-02-04 20:44:53,915 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 20:44:53,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:44:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 20:44:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2018-02-04 20:44:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 20:44:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2018-02-04 20:44:53,922 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 46 [2018-02-04 20:44:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:53,923 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2018-02-04 20:44:53,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 20:44:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2018-02-04 20:44:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 20:44:53,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:53,924 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:53,924 INFO L371 AbstractCegarLoop]: === Iteration 6 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -506792822, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:53,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:54,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:54,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:44:54,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 20:44:54,109 INFO L182 omatonBuilderFactory]: Interpolants [2352#true, 2400#(= 0 |#Ultimate.meminit_#t~loopctr33|), 2353#false, 2401#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 2402#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 2390#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2391#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2392#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 2398#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 2399#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:44:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:54,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 20:44:54,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 20:44:54,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:44:54,110 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand 10 states. [2018-02-04 20:44:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:54,708 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-02-04 20:44:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:44:54,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 20:44:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:54,709 INFO L225 Difference]: With dead ends: 198 [2018-02-04 20:44:54,709 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 20:44:54,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:44:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 20:44:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-02-04 20:44:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 20:44:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 193 transitions. [2018-02-04 20:44:54,715 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 193 transitions. Word has length 47 [2018-02-04 20:44:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:54,716 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 193 transitions. [2018-02-04 20:44:54,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 20:44:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 193 transitions. [2018-02-04 20:44:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 20:44:54,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:54,717 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:54,717 INFO L371 AbstractCegarLoop]: === Iteration 7 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1866751778, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:54,721 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:54,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:54,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 20:44:54,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:54,853 INFO L182 omatonBuilderFactory]: Interpolants [2819#true, 2867#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 2820#false, 2868#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2869#(= 0 |#Ultimate.meminit_#t~loopctr33|), 2870#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 2871#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 2872#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 2858#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 2859#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 2860#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:54,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:44:54,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:44:54,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:44:54,854 INFO L87 Difference]: Start difference. First operand 181 states and 193 transitions. Second operand 11 states. [2018-02-04 20:44:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:55,403 INFO L93 Difference]: Finished difference Result 204 states and 221 transitions. [2018-02-04 20:44:55,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:44:55,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 20:44:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:55,405 INFO L225 Difference]: With dead ends: 204 [2018-02-04 20:44:55,405 INFO L226 Difference]: Without dead ends: 199 [2018-02-04 20:44:55,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:44:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-04 20:44:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2018-02-04 20:44:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 20:44:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2018-02-04 20:44:55,412 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 48 [2018-02-04 20:44:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:55,412 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2018-02-04 20:44:55,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:44:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2018-02-04 20:44:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 20:44:55,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:55,413 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:55,413 INFO L371 AbstractCegarLoop]: === Iteration 8 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1862776950, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:55,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:55,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:55,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:44:55,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:55,617 INFO L182 omatonBuilderFactory]: Interpolants [3300#true, 3301#false, 3350#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 3351#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3352#(= 0 |#Ultimate.meminit_#t~loopctr33|), 3353#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 3354#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 3355#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 3340#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3356#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 3341#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3342#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:55,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:44:55,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:44:55,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:44:55,618 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 12 states. [2018-02-04 20:44:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:56,246 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-02-04 20:44:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:44:56,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-02-04 20:44:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:56,247 INFO L225 Difference]: With dead ends: 208 [2018-02-04 20:44:56,247 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 20:44:56,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-02-04 20:44:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 20:44:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2018-02-04 20:44:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 20:44:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2018-02-04 20:44:56,252 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 49 [2018-02-04 20:44:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:56,252 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2018-02-04 20:44:56,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:44:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2018-02-04 20:44:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 20:44:56,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:56,253 INFO L351 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:56,253 INFO L371 AbstractCegarLoop]: === Iteration 9 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1514050526, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:56,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:56,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:56,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:44:56,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:56,396 INFO L182 omatonBuilderFactory]: Interpolants [3845#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 3846#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3847#(= 0 |#Ultimate.meminit_#t~loopctr33|), 3848#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 3849#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 3850#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 3851#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 3852#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 3793#true, 3794#false, 3834#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 3835#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3836#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:56,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:44:56,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:44:56,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:44:56,397 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand 13 states. [2018-02-04 20:44:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:57,021 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2018-02-04 20:44:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 20:44:57,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-04 20:44:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:57,023 INFO L225 Difference]: With dead ends: 212 [2018-02-04 20:44:57,023 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 20:44:57,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:44:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 20:44:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2018-02-04 20:44:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 20:44:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-02-04 20:44:57,027 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 50 [2018-02-04 20:44:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:57,028 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-02-04 20:44:57,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:44:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-02-04 20:44:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 20:44:57,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:57,029 INFO L351 BasicCegarLoop]: trace histogram [7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:57,029 INFO L371 AbstractCegarLoop]: === Iteration 10 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 706534026, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:57,032 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:57,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:57,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:44:57,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:57,167 INFO L182 omatonBuilderFactory]: Interpolants [4352#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 4353#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4354#(= 0 |#Ultimate.meminit_#t~loopctr33|), 4355#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 4356#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 4357#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 4358#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 4359#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 4360#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 4298#true, 4299#false, 4340#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4341#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4342#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:57,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:44:57,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:44:57,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:44:57,168 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 14 states. [2018-02-04 20:44:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:57,828 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2018-02-04 20:44:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:44:57,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-02-04 20:44:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:57,829 INFO L225 Difference]: With dead ends: 216 [2018-02-04 20:44:57,829 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 20:44:57,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:44:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 20:44:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-02-04 20:44:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 20:44:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-02-04 20:44:57,834 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 51 [2018-02-04 20:44:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:57,834 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-02-04 20:44:57,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:44:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-02-04 20:44:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 20:44:57,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:57,835 INFO L351 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:57,836 INFO L371 AbstractCegarLoop]: === Iteration 11 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 825178402, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:57,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:57,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:57,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:44:57,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:57,982 INFO L182 omatonBuilderFactory]: Interpolants [4871#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 4872#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4873#(= 0 |#Ultimate.meminit_#t~loopctr33|), 4874#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 4875#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 4876#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 4877#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 4878#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 4815#true, 4879#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 4816#false, 4880#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 4858#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 4859#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 4860#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:44:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:57,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:44:57,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:44:57,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:44:57,983 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 15 states. [2018-02-04 20:44:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:58,704 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-04 20:44:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:44:58,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 20:44:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:58,706 INFO L225 Difference]: With dead ends: 220 [2018-02-04 20:44:58,706 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 20:44:58,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 20:44:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 20:44:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 186. [2018-02-04 20:44:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 20:44:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2018-02-04 20:44:58,709 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 52 [2018-02-04 20:44:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:58,709 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2018-02-04 20:44:58,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:44:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2018-02-04 20:44:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 20:44:58,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:58,710 INFO L351 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:58,710 INFO L371 AbstractCegarLoop]: === Iteration 12 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 208186762, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:58,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:58,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:58,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:44:58,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:58,871 INFO L182 omatonBuilderFactory]: Interpolants [5344#true, 5408#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 5345#false, 5409#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 5410#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 5411#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 5412#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 5388#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5389#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5390#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 5402#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 5403#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5404#(= 0 |#Ultimate.meminit_#t~loopctr33|), 5405#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 5406#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 5407#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3))] [2018-02-04 20:44:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:58,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:44:58,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:44:58,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:44:58,872 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand 16 states. [2018-02-04 20:44:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:44:59,627 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2018-02-04 20:44:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:44:59,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-04 20:44:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:44:59,628 INFO L225 Difference]: With dead ends: 224 [2018-02-04 20:44:59,628 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 20:44:59,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 20:44:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 20:44:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 187. [2018-02-04 20:44:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 20:44:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-04 20:44:59,631 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 53 [2018-02-04 20:44:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:44:59,631 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-04 20:44:59,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:44:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-04 20:44:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 20:44:59,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:44:59,632 INFO L351 BasicCegarLoop]: trace histogram [10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:44:59,632 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:44:59,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1738684894, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:44:59,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:44:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:44:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:59,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:44:59,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:44:59,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:44:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:44:59,803 INFO L182 omatonBuilderFactory]: Interpolants [5952#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 5953#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 5954#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 5955#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 5956#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 5930#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 5931#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5932#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 5945#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 5946#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5947#(= 0 |#Ultimate.meminit_#t~loopctr33|), 5948#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 5885#true, 5949#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 5886#false, 5950#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 5951#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4))] [2018-02-04 20:44:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:44:59,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:44:59,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:44:59,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:44:59,804 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 17 states. [2018-02-04 20:45:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:00,561 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2018-02-04 20:45:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 20:45:00,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-02-04 20:45:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:00,562 INFO L225 Difference]: With dead ends: 228 [2018-02-04 20:45:00,562 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 20:45:00,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:45:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 20:45:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 188. [2018-02-04 20:45:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 20:45:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-02-04 20:45:00,566 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 54 [2018-02-04 20:45:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:00,566 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-02-04 20:45:00,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:45:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-02-04 20:45:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 20:45:00,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:00,567 INFO L351 BasicCegarLoop]: trace histogram [11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:00,567 INFO L371 AbstractCegarLoop]: === Iteration 14 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1962164086, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:00,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:00,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:00,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:45:00,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:45:00,784 INFO L182 omatonBuilderFactory]: Interpolants [6500#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 6501#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6438#true, 6502#(= 0 |#Ultimate.meminit_#t~loopctr33|), 6439#false, 6503#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 6504#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 6505#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 6506#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 6507#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 6508#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 6509#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 6510#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 6511#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 6512#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 6484#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 6485#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6486#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:00,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:45:00,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:45:00,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:45:00,785 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 18 states. [2018-02-04 20:45:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:01,667 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2018-02-04 20:45:01,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 20:45:01,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-02-04 20:45:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:01,668 INFO L225 Difference]: With dead ends: 232 [2018-02-04 20:45:01,668 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 20:45:01,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=475, Invalid=1687, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 20:45:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 20:45:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2018-02-04 20:45:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 20:45:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2018-02-04 20:45:01,674 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 55 [2018-02-04 20:45:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:01,674 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2018-02-04 20:45:01,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:45:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2018-02-04 20:45:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 20:45:01,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:01,675 INFO L351 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:01,675 INFO L371 AbstractCegarLoop]: === Iteration 15 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -300084446, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:01,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:01,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:01,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:45:01,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:45:01,935 INFO L182 omatonBuilderFactory]: Interpolants [7072#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 7073#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 7074#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 7075#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 7076#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 7077#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 7078#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 7079#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 7080#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 7050#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7051#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7052#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 7003#true, 7067#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 7004#false, 7068#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7069#(= 0 |#Ultimate.meminit_#t~loopctr33|), 7070#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 7071#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2))] [2018-02-04 20:45:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:01,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:45:01,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:45:01,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:45:01,936 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand 19 states. [2018-02-04 20:45:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:03,269 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-04 20:45:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 20:45:03,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-04 20:45:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:03,271 INFO L225 Difference]: With dead ends: 236 [2018-02-04 20:45:03,271 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 20:45:03,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=548, Invalid=1902, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 20:45:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 20:45:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 190. [2018-02-04 20:45:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 20:45:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2018-02-04 20:45:03,276 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 56 [2018-02-04 20:45:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:03,277 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2018-02-04 20:45:03,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:45:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2018-02-04 20:45:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 20:45:03,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:03,278 INFO L351 BasicCegarLoop]: trace histogram [13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:03,278 INFO L371 AbstractCegarLoop]: === Iteration 16 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -315223158, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:03,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:03,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:03,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:45:03,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 20:45:03,539 INFO L182 omatonBuilderFactory]: Interpolants [7648#(= 0 |#Ultimate.meminit_#t~loopctr33|), 7649#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 7650#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 7651#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 7652#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 7653#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 7654#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 7655#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 7656#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 7657#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 7658#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 7659#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 7628#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 7660#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 12))), 7629#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7630#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 7580#true, 7581#false, 7646#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 12)), 7647#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:45:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 20:45:03,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:45:03,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:45:03,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:45:03,539 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand 20 states. [2018-02-04 20:45:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:04,655 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-04 20:45:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 20:45:04,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-02-04 20:45:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:04,657 INFO L225 Difference]: With dead ends: 240 [2018-02-04 20:45:04,657 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 20:45:04,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=627, Invalid=2129, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 20:45:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 20:45:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 191. [2018-02-04 20:45:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 20:45:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-02-04 20:45:04,662 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 57 [2018-02-04 20:45:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:04,662 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-02-04 20:45:04,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:45:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-02-04 20:45:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 20:45:04,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:04,663 INFO L351 BasicCegarLoop]: trace histogram [14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:04,663 INFO L371 AbstractCegarLoop]: === Iteration 17 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -784523230, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:04,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:04,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:04,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:45:04,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 20:45:04,815 INFO L182 omatonBuilderFactory]: Interpolants [8243#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 8244#(= 0 |#Ultimate.meminit_#t~loopctr33|), 8245#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 8246#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 8169#true, 8170#false, 8218#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 8219#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8236#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8237#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:04,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 20:45:04,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 20:45:04,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:45:04,816 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 10 states. [2018-02-04 20:45:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:05,289 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-02-04 20:45:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:45:05,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 20:45:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:05,290 INFO L225 Difference]: With dead ends: 214 [2018-02-04 20:45:05,290 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 20:45:05,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:45:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 20:45:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 197. [2018-02-04 20:45:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 20:45:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2018-02-04 20:45:05,294 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 58 [2018-02-04 20:45:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:05,294 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2018-02-04 20:45:05,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 20:45:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2018-02-04 20:45:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 20:45:05,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:05,295 INFO L351 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:05,295 INFO L371 AbstractCegarLoop]: === Iteration 18 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2137587734, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:05,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:05,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:05,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 20:45:05,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:05,426 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-04 20:45:05,426 INFO L182 omatonBuilderFactory]: Interpolants [8768#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 8769#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 8690#true, 8770#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 8691#false, 8740#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 8741#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8758#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8759#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 8766#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 8767#(= 0 |#Ultimate.meminit_#t~loopctr33|)] [2018-02-04 20:45:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:05,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:45:05,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:45:05,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:45:05,427 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand 11 states. [2018-02-04 20:45:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:05,948 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2018-02-04 20:45:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:45:05,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-04 20:45:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:05,949 INFO L225 Difference]: With dead ends: 220 [2018-02-04 20:45:05,949 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 20:45:05,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:45:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 20:45:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2018-02-04 20:45:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 20:45:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 211 transitions. [2018-02-04 20:45:05,951 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 211 transitions. Word has length 59 [2018-02-04 20:45:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:05,951 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 211 transitions. [2018-02-04 20:45:05,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:45:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 211 transitions. [2018-02-04 20:45:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 20:45:05,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:05,952 INFO L351 BasicCegarLoop]: trace histogram [16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:05,952 INFO L371 AbstractCegarLoop]: === Iteration 19 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1766252894, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:05,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:06,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:06,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:45:06,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:06,078 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-04 20:45:06,078 INFO L182 omatonBuilderFactory]: Interpolants [9303#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 9304#(= 0 |#Ultimate.meminit_#t~loopctr33|), 9225#true, 9305#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 9226#false, 9306#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 9307#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 9276#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 9308#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 9277#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9294#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9295#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:06,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:45:06,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:45:06,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:45:06,078 INFO L87 Difference]: Start difference. First operand 198 states and 211 transitions. Second operand 12 states. [2018-02-04 20:45:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:06,668 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2018-02-04 20:45:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:45:06,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-02-04 20:45:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:06,669 INFO L225 Difference]: With dead ends: 224 [2018-02-04 20:45:06,669 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 20:45:06,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-02-04 20:45:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 20:45:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2018-02-04 20:45:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 20:45:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 212 transitions. [2018-02-04 20:45:06,673 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 212 transitions. Word has length 60 [2018-02-04 20:45:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:06,674 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 212 transitions. [2018-02-04 20:45:06,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:45:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 212 transitions. [2018-02-04 20:45:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 20:45:06,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:06,675 INFO L351 BasicCegarLoop]: trace histogram [17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:06,675 INFO L371 AbstractCegarLoop]: === Iteration 20 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1768739222, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:06,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:06,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:06,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:45:06,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:06,812 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-04 20:45:06,812 INFO L182 omatonBuilderFactory]: Interpolants [9824#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 9856#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 9825#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9857#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 9858#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 9772#true, 9773#false, 9842#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9843#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 9852#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 9853#(= 0 |#Ultimate.meminit_#t~loopctr33|), 9854#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 9855#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2))] [2018-02-04 20:45:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:06,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:45:06,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:45:06,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:45:06,812 INFO L87 Difference]: Start difference. First operand 199 states and 212 transitions. Second operand 13 states. [2018-02-04 20:45:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:07,400 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2018-02-04 20:45:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 20:45:07,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 20:45:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:07,401 INFO L225 Difference]: With dead ends: 228 [2018-02-04 20:45:07,401 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 20:45:07,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:45:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 20:45:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 200. [2018-02-04 20:45:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 20:45:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2018-02-04 20:45:07,404 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 61 [2018-02-04 20:45:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:07,404 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2018-02-04 20:45:07,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:45:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2018-02-04 20:45:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 20:45:07,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:07,405 INFO L351 BasicCegarLoop]: trace histogram [18, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:07,405 INFO L371 AbstractCegarLoop]: === Iteration 21 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash -315654878, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:07,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 85 proven. 34 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:07,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:07,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:45:07,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:07,545 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-04 20:45:07,545 INFO L182 omatonBuilderFactory]: Interpolants [10402#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10403#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 10413#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 10414#(= 0 |#Ultimate.meminit_#t~loopctr33|), 10415#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 10384#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 10416#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 10385#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10417#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 10418#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 10419#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 10420#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 10331#true, 10332#false] [2018-02-04 20:45:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 85 proven. 34 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:07,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:45:07,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:45:07,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:45:07,546 INFO L87 Difference]: Start difference. First operand 200 states and 213 transitions. Second operand 14 states. [2018-02-04 20:45:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:08,150 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-02-04 20:45:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:45:08,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 20:45:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:08,151 INFO L225 Difference]: With dead ends: 232 [2018-02-04 20:45:08,151 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 20:45:08,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:45:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 20:45:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 201. [2018-02-04 20:45:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 20:45:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 214 transitions. [2018-02-04 20:45:08,154 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 214 transitions. Word has length 62 [2018-02-04 20:45:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:08,154 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 214 transitions. [2018-02-04 20:45:08,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:45:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 214 transitions. [2018-02-04 20:45:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 20:45:08,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:08,155 INFO L351 BasicCegarLoop]: trace histogram [19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:08,155 INFO L371 AbstractCegarLoop]: === Iteration 22 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash -507362538, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:08,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 98 proven. 42 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:08,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:08,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:45:08,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:08,307 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-04 20:45:08,307 INFO L182 omatonBuilderFactory]: Interpolants [10986#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 10987#(= 0 |#Ultimate.meminit_#t~loopctr33|), 10956#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 10988#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 10957#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10989#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 10990#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 10991#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 10992#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 10993#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 10994#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 10902#true, 10903#false, 10974#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10975#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 98 proven. 42 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:08,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:45:08,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:45:08,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:45:08,308 INFO L87 Difference]: Start difference. First operand 201 states and 214 transitions. Second operand 15 states. [2018-02-04 20:45:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:09,092 INFO L93 Difference]: Finished difference Result 236 states and 256 transitions. [2018-02-04 20:45:09,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:45:09,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-04 20:45:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:09,093 INFO L225 Difference]: With dead ends: 236 [2018-02-04 20:45:09,093 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 20:45:09,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 20:45:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 20:45:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 202. [2018-02-04 20:45:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 20:45:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2018-02-04 20:45:09,095 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 63 [2018-02-04 20:45:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:09,096 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2018-02-04 20:45:09,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:45:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2018-02-04 20:45:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 20:45:09,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:09,096 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:09,096 INFO L371 AbstractCegarLoop]: === Iteration 23 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2139634594, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:09,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 111 proven. 51 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:09,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:09,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:45:09,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:09,286 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-04 20:45:09,286 INFO L182 omatonBuilderFactory]: Interpolants [11558#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11559#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 11571#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 11540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 11572#(= 0 |#Ultimate.meminit_#t~loopctr33|), 11541#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11573#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 11574#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 11575#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 11576#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 11577#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 11578#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 11579#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 11580#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 11485#true, 11486#false] [2018-02-04 20:45:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 111 proven. 51 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:09,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:45:09,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:45:09,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:45:09,286 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand 16 states. [2018-02-04 20:45:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:10,058 INFO L93 Difference]: Finished difference Result 240 states and 261 transitions. [2018-02-04 20:45:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:45:10,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-02-04 20:45:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:10,059 INFO L225 Difference]: With dead ends: 240 [2018-02-04 20:45:10,059 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 20:45:10,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 20:45:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 20:45:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2018-02-04 20:45:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 20:45:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-02-04 20:45:10,067 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 64 [2018-02-04 20:45:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:10,067 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-02-04 20:45:10,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:45:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-02-04 20:45:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 20:45:10,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:10,068 INFO L351 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:10,068 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1702800234, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:10,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 124 proven. 61 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:10,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:10,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:45:10,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:10,251 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-04 20:45:10,251 INFO L182 omatonBuilderFactory]: Interpolants [12136#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 12168#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 12137#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12169#(= 0 |#Ultimate.meminit_#t~loopctr33|), 12170#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 12171#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 12172#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 12173#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 12174#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 12175#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 12080#true, 12176#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 12081#false, 12177#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 12178#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 12154#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12155#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 124 proven. 61 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:10,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:45:10,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:45:10,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:45:10,251 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 17 states. [2018-02-04 20:45:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:11,156 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2018-02-04 20:45:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 20:45:11,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-04 20:45:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:11,157 INFO L225 Difference]: With dead ends: 244 [2018-02-04 20:45:11,157 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 20:45:11,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:45:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 20:45:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 204. [2018-02-04 20:45:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 20:45:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-04 20:45:11,160 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 65 [2018-02-04 20:45:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:11,160 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-04 20:45:11,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:45:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-04 20:45:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 20:45:11,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:11,161 INFO L351 BasicCegarLoop]: trace histogram [22, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:11,161 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -559195614, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:11,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 137 proven. 72 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:11,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:11,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 20:45:11,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:11,352 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-04 20:45:11,352 INFO L182 omatonBuilderFactory]: Interpolants [12744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 12745#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12777#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 12778#(= 0 |#Ultimate.meminit_#t~loopctr33|), 12779#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 12780#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 12781#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 12782#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 12687#true, 12783#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 12688#false, 12784#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 12785#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 12786#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 12787#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 12788#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 12762#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12763#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 137 proven. 72 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:11,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 20:45:11,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 20:45:11,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-02-04 20:45:11,352 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 18 states. [2018-02-04 20:45:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:12,334 INFO L93 Difference]: Finished difference Result 248 states and 271 transitions. [2018-02-04 20:45:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 20:45:12,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-04 20:45:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:12,335 INFO L225 Difference]: With dead ends: 248 [2018-02-04 20:45:12,335 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 20:45:12,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=475, Invalid=1687, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 20:45:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 20:45:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 205. [2018-02-04 20:45:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 20:45:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-02-04 20:45:12,338 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 66 [2018-02-04 20:45:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:12,338 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-02-04 20:45:12,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 20:45:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-02-04 20:45:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 20:45:12,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:12,339 INFO L351 BasicCegarLoop]: trace histogram [23, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:12,339 INFO L371 AbstractCegarLoop]: === Iteration 26 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:12,339 INFO L82 PathProgramCache]: Analyzing trace with hash 532809238, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:12,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 150 proven. 84 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:12,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:12,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 20:45:12,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:12,658 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-04 20:45:12,658 INFO L182 omatonBuilderFactory]: Interpolants [13408#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 13409#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 13410#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 13382#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13383#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 13364#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 13365#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13398#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 13399#(= 0 |#Ultimate.meminit_#t~loopctr33|), 13400#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 13401#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 13306#true, 13402#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 13307#false, 13403#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 13404#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 13405#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 13406#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 13407#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8))] [2018-02-04 20:45:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 150 proven. 84 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:12,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 20:45:12,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 20:45:12,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 20:45:12,660 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 19 states. [2018-02-04 20:45:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:13,556 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2018-02-04 20:45:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 20:45:13,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-04 20:45:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:13,557 INFO L225 Difference]: With dead ends: 252 [2018-02-04 20:45:13,557 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 20:45:13,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=548, Invalid=1902, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 20:45:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 20:45:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 206. [2018-02-04 20:45:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 20:45:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-02-04 20:45:13,561 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 67 [2018-02-04 20:45:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:13,561 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-02-04 20:45:13,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 20:45:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-02-04 20:45:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 20:45:13,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:13,562 INFO L351 BasicCegarLoop]: trace histogram [24, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:13,562 INFO L371 AbstractCegarLoop]: === Iteration 27 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash 25221282, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:13,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 163 proven. 97 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:13,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:13,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 20:45:13,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:13,779 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-04 20:45:13,779 INFO L182 omatonBuilderFactory]: Interpolants [13996#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 13997#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14031#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 14032#(= 0 |#Ultimate.meminit_#t~loopctr33|), 13937#true, 14033#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 13938#false, 14034#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 14035#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 14036#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 14037#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 14038#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 14039#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 14040#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 14041#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 14042#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 14043#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 14044#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 14014#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14015#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 163 proven. 97 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:13,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 20:45:13,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 20:45:13,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 20:45:13,779 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 20 states. [2018-02-04 20:45:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:14,900 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2018-02-04 20:45:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 20:45:14,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-02-04 20:45:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:14,901 INFO L225 Difference]: With dead ends: 256 [2018-02-04 20:45:14,901 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 20:45:14,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=627, Invalid=2129, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 20:45:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 20:45:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 207. [2018-02-04 20:45:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 20:45:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions. [2018-02-04 20:45:14,905 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 68 [2018-02-04 20:45:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:14,905 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions. [2018-02-04 20:45:14,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 20:45:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions. [2018-02-04 20:45:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 20:45:14,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:14,905 INFO L351 BasicCegarLoop]: trace histogram [25, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:14,905 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:14,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1469863830, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:14,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 176 proven. 111 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:15,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:15,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 20:45:15,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:15,145 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-04 20:45:15,145 INFO L182 omatonBuilderFactory]: Interpolants [14688#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 14689#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 14658#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14690#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 14659#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 14640#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 14641#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14580#true, 14676#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 14581#false, 14677#(= 0 |#Ultimate.meminit_#t~loopctr33|), 14678#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 14679#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 14680#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 14681#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 14682#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 14683#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 14684#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 14685#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 14686#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 14687#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10))] [2018-02-04 20:45:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 176 proven. 111 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:15,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 20:45:15,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 20:45:15,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-02-04 20:45:15,145 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 21 states. [2018-02-04 20:45:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:15,956 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2018-02-04 20:45:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 20:45:15,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-02-04 20:45:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:15,957 INFO L225 Difference]: With dead ends: 263 [2018-02-04 20:45:15,957 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 20:45:15,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 20:45:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 20:45:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 208. [2018-02-04 20:45:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 20:45:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-04 20:45:15,960 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 69 [2018-02-04 20:45:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:15,961 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-04 20:45:15,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 20:45:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-04 20:45:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 20:45:15,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:15,961 INFO L351 BasicCegarLoop]: trace histogram [26, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:15,961 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash -990857438, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:15,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 189 proven. 126 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:16,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:16,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 20:45:16,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:16,215 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-04 20:45:16,215 INFO L182 omatonBuilderFactory]: Interpolants [15299#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 15300#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15238#true, 15239#false, 15336#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 15337#(= 0 |#Ultimate.meminit_#t~loopctr33|), 15338#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 15339#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 15340#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 15341#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 15342#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 15343#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 15344#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 15345#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 15346#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 15347#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 15348#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 15317#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15349#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 15318#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 15350#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 15351#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20)))] [2018-02-04 20:45:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 189 proven. 126 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:16,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 20:45:16,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 20:45:16,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-02-04 20:45:16,217 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 22 states. [2018-02-04 20:45:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:17,406 INFO L93 Difference]: Finished difference Result 270 states and 299 transitions. [2018-02-04 20:45:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 20:45:17,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-02-04 20:45:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:17,407 INFO L225 Difference]: With dead ends: 270 [2018-02-04 20:45:17,407 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 20:45:17,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=803, Invalid=2619, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 20:45:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 20:45:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 209. [2018-02-04 20:45:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 20:45:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 222 transitions. [2018-02-04 20:45:17,410 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 222 transitions. Word has length 70 [2018-02-04 20:45:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:17,410 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 222 transitions. [2018-02-04 20:45:17,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 20:45:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2018-02-04 20:45:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 20:45:17,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:17,411 INFO L351 BasicCegarLoop]: trace histogram [27, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:17,411 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash 36194582, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:17,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 202 proven. 142 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:17,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:17,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 20:45:17,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:17,671 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-04 20:45:17,671 INFO L182 omatonBuilderFactory]: Interpolants [15973#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 15974#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 15911#true, 15912#false, 16011#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 16012#(= 0 |#Ultimate.meminit_#t~loopctr33|), 16013#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 16014#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 16015#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 16016#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 16017#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 16018#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 16019#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 16020#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 16021#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 16022#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 15991#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16023#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 15992#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 16024#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 16025#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 16026#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 16027#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20)))] [2018-02-04 20:45:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 202 proven. 142 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:17,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 20:45:17,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 20:45:17,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:45:17,672 INFO L87 Difference]: Start difference. First operand 209 states and 222 transitions. Second operand 23 states. [2018-02-04 20:45:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:18,870 INFO L93 Difference]: Finished difference Result 277 states and 308 transitions. [2018-02-04 20:45:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 20:45:18,871 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-04 20:45:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:18,871 INFO L225 Difference]: With dead ends: 277 [2018-02-04 20:45:18,871 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 20:45:18,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=900, Invalid=2882, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 20:45:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 20:45:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 210. [2018-02-04 20:45:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 20:45:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-04 20:45:18,876 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 71 [2018-02-04 20:45:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:18,876 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-04 20:45:18,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 20:45:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-04 20:45:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 20:45:18,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:18,877 INFO L351 BasicCegarLoop]: trace histogram [28, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:18,877 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1810036130, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:18,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 215 proven. 159 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:19,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:19,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 20:45:19,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:19,155 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-04 20:45:19,155 INFO L182 omatonBuilderFactory]: Interpolants [16704#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 16705#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 16706#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 16707#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 16708#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 16709#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 16710#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 16711#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 16680#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16712#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 16681#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 16713#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 16714#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 16715#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 16716#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 16717#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 15)), 16718#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 16662#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 16599#true, 16663#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16600#false, 16701#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 16702#(= 0 |#Ultimate.meminit_#t~loopctr33|), 16703#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|)] [2018-02-04 20:45:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 215 proven. 159 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:19,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 20:45:19,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 20:45:19,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-04 20:45:19,156 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 24 states. [2018-02-04 20:45:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:20,349 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2018-02-04 20:45:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 20:45:20,349 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-02-04 20:45:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:20,350 INFO L225 Difference]: With dead ends: 284 [2018-02-04 20:45:20,350 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 20:45:20,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1003, Invalid=3157, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 20:45:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 20:45:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2018-02-04 20:45:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 20:45:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-02-04 20:45:20,354 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 72 [2018-02-04 20:45:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:20,354 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-02-04 20:45:20,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 20:45:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-02-04 20:45:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 20:45:20,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:20,354 INFO L351 BasicCegarLoop]: trace histogram [29, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:20,354 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 964549270, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:20,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 228 proven. 177 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:20,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:20,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 20:45:20,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:20,635 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-04 20:45:20,635 INFO L182 omatonBuilderFactory]: Interpolants [17408#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 17409#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 17410#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 17411#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 17412#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 17413#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 17414#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 17415#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 17416#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 17417#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 17418#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 17419#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 17420#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 17421#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 17422#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 15)), 17423#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 16)), 17424#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 17302#true, 17366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 17303#false, 17367#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17384#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17385#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 17406#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 17407#(= 0 |#Ultimate.meminit_#t~loopctr33|)] [2018-02-04 20:45:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 228 proven. 177 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:20,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 20:45:20,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 20:45:20,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2018-02-04 20:45:20,636 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 25 states. [2018-02-04 20:45:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:21,984 INFO L93 Difference]: Finished difference Result 291 states and 326 transitions. [2018-02-04 20:45:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 20:45:21,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-02-04 20:45:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:21,985 INFO L225 Difference]: With dead ends: 291 [2018-02-04 20:45:21,985 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 20:45:21,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1112, Invalid=3444, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 20:45:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 20:45:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 212. [2018-02-04 20:45:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 20:45:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2018-02-04 20:45:21,988 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 73 [2018-02-04 20:45:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:21,989 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2018-02-04 20:45:21,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 20:45:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2018-02-04 20:45:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 20:45:21,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:21,989 INFO L351 BasicCegarLoop]: trace histogram [30, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:21,989 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 524260386, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:21,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 241 proven. 196 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:22,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:22,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 20:45:22,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:22,275 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-04 20:45:22,276 INFO L182 omatonBuilderFactory]: Interpolants [18126#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 18127#(= 0 |#Ultimate.meminit_#t~loopctr33|), 18128#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 18129#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 18130#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 18131#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 18132#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 18133#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 18134#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 18135#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 18136#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 18137#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 18138#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 18139#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 18140#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 18141#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 18142#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 15)), 18143#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 16)), 18144#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 17)), 18145#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 18020#true, 18021#false, 18085#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 18086#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18103#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18104#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 241 proven. 196 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:22,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 20:45:22,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 20:45:22,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:45:22,277 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand 26 states. [2018-02-04 20:45:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:23,274 INFO L93 Difference]: Finished difference Result 298 states and 335 transitions. [2018-02-04 20:45:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 20:45:23,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 74 [2018-02-04 20:45:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:23,275 INFO L225 Difference]: With dead ends: 298 [2018-02-04 20:45:23,275 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 20:45:23,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1227, Invalid=3743, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 20:45:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 20:45:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 213. [2018-02-04 20:45:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 20:45:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2018-02-04 20:45:23,278 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 74 [2018-02-04 20:45:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:23,279 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2018-02-04 20:45:23,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 20:45:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2018-02-04 20:45:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 20:45:23,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:23,279 INFO L351 BasicCegarLoop]: trace histogram [31, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:23,279 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -239793130, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:23,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 254 proven. 216 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:23,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:23,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 20:45:23,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:23,584 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-04 20:45:23,584 INFO L182 omatonBuilderFactory]: Interpolants [18880#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 18)), 18753#true, 18881#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 18754#false, 18819#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 18820#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18837#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 18838#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 18861#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 18862#(= 0 |#Ultimate.meminit_#t~loopctr33|), 18863#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 18864#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 18865#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 18866#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 18867#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 18868#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 18869#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 18870#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 18871#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 18872#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 18873#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 18874#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 18875#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 18876#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 18877#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 15)), 18878#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 16)), 18879#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 17))] [2018-02-04 20:45:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 254 proven. 216 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:23,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 20:45:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 20:45:23,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2018-02-04 20:45:23,585 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 27 states. [2018-02-04 20:45:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:24,595 INFO L93 Difference]: Finished difference Result 305 states and 344 transitions. [2018-02-04 20:45:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 20:45:24,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 75 [2018-02-04 20:45:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:24,596 INFO L225 Difference]: With dead ends: 305 [2018-02-04 20:45:24,596 INFO L226 Difference]: Without dead ends: 300 [2018-02-04 20:45:24,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1348, Invalid=4054, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 20:45:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-04 20:45:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 214. [2018-02-04 20:45:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 20:45:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-02-04 20:45:24,598 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 75 [2018-02-04 20:45:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:24,599 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-02-04 20:45:24,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 20:45:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-02-04 20:45:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 20:45:24,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:24,599 INFO L351 BasicCegarLoop]: trace histogram [32, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:24,599 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1844351650, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:24,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 267 proven. 237 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:25,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:25,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 20:45:25,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:25,045 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-04 20:45:25,046 INFO L182 omatonBuilderFactory]: Interpolants [19586#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19587#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 19611#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 20)), 19612#(= 0 |#Ultimate.meminit_#t~loopctr33|), 19613#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 19614#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 19615#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 19616#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 19617#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 19618#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 19619#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 19620#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 19621#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 9)), 19622#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 10)), 19623#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 11)), 19624#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 12)), 19625#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 13)), 19626#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 14)), 19627#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 15)), 19628#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 16)), 19501#true, 19629#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 17)), 19502#false, 19630#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 18)), 19631#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 19)), 19568#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 19632#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 20))), 19569#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:45:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 267 proven. 237 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-02-04 20:45:25,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 20:45:25,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 20:45:25,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=513, Unknown=0, NotChecked=0, Total=756 [2018-02-04 20:45:25,046 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 28 states. [2018-02-04 20:45:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:26,549 INFO L93 Difference]: Finished difference Result 312 states and 353 transitions. [2018-02-04 20:45:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 20:45:26,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-04 20:45:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:26,550 INFO L225 Difference]: With dead ends: 312 [2018-02-04 20:45:26,551 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 20:45:26,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1475, Invalid=4377, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 20:45:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 20:45:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 215. [2018-02-04 20:45:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 20:45:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 228 transitions. [2018-02-04 20:45:26,556 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 228 transitions. Word has length 76 [2018-02-04 20:45:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:26,556 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 228 transitions. [2018-02-04 20:45:26,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 20:45:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2018-02-04 20:45:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 20:45:26,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:26,557 INFO L351 BasicCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:26,557 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2028330390, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:26,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:26,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:26,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 20:45:26,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:26,679 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-04 20:45:26,679 INFO L182 omatonBuilderFactory]: Interpolants [20384#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 20375#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 20264#true, 20265#false, 20332#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 20333#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20381#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 20350#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20382#(= 0 |#Ultimate.meminit_#t~loopctr33|), 20383#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|)] [2018-02-04 20:45:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:26,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 20:45:26,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 20:45:26,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:45:26,679 INFO L87 Difference]: Start difference. First operand 215 states and 228 transitions. Second operand 10 states. [2018-02-04 20:45:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:27,101 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-02-04 20:45:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 20:45:27,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-02-04 20:45:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:27,101 INFO L225 Difference]: With dead ends: 232 [2018-02-04 20:45:27,101 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 20:45:27,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-04 20:45:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 20:45:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 216. [2018-02-04 20:45:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 20:45:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 227 transitions. [2018-02-04 20:45:27,103 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 227 transitions. Word has length 77 [2018-02-04 20:45:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:27,104 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 227 transitions. [2018-02-04 20:45:27,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 20:45:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 227 transitions. [2018-02-04 20:45:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 20:45:27,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:27,104 INFO L351 BasicCegarLoop]: trace histogram [34, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:27,104 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1335770130, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:27,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:27,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:27,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 20:45:27,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:27,228 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-04 20:45:27,229 INFO L182 omatonBuilderFactory]: Interpolants [20929#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 20930#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20947#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20979#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 20980#(= 0 |#Ultimate.meminit_#t~loopctr33|), 20981#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 20982#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 20983#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 20860#true, 20972#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 20861#false] [2018-02-04 20:45:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:27,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 20:45:27,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 20:45:27,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:45:27,229 INFO L87 Difference]: Start difference. First operand 216 states and 227 transitions. Second operand 11 states. [2018-02-04 20:45:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:27,691 INFO L93 Difference]: Finished difference Result 233 states and 245 transitions. [2018-02-04 20:45:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 20:45:27,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-02-04 20:45:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:27,691 INFO L225 Difference]: With dead ends: 233 [2018-02-04 20:45:27,692 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 20:45:27,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-02-04 20:45:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 20:45:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 217. [2018-02-04 20:45:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 20:45:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 228 transitions. [2018-02-04 20:45:27,694 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 228 transitions. Word has length 78 [2018-02-04 20:45:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:27,694 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 228 transitions. [2018-02-04 20:45:27,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 20:45:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 228 transitions. [2018-02-04 20:45:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 20:45:27,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:27,695 INFO L351 BasicCegarLoop]: trace histogram [35, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:27,695 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1751296150, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:27,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 150 proven. 6 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:27,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:27,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 20:45:27,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:27,828 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-04 20:45:27,828 INFO L182 omatonBuilderFactory]: Interpolants [21536#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21553#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21586#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 21587#(= 0 |#Ultimate.meminit_#t~loopctr33|), 21588#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 21589#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 21590#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 21591#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 21465#true, 21466#false, 21578#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 21535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))] [2018-02-04 20:45:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 150 proven. 6 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:27,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 20:45:27,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 20:45:27,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 20:45:27,829 INFO L87 Difference]: Start difference. First operand 217 states and 228 transitions. Second operand 12 states. [2018-02-04 20:45:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:28,362 INFO L93 Difference]: Finished difference Result 234 states and 246 transitions. [2018-02-04 20:45:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 20:45:28,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-02-04 20:45:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:28,363 INFO L225 Difference]: With dead ends: 234 [2018-02-04 20:45:28,363 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 20:45:28,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-02-04 20:45:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 20:45:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2018-02-04 20:45:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 20:45:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 229 transitions. [2018-02-04 20:45:28,365 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 229 transitions. Word has length 79 [2018-02-04 20:45:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:28,365 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 229 transitions. [2018-02-04 20:45:28,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 20:45:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 229 transitions. [2018-02-04 20:45:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 20:45:28,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:28,365 INFO L351 BasicCegarLoop]: trace histogram [36, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:28,365 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1333896978, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:28,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 184 proven. 10 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:28,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:28,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 20:45:28,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:28,541 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-04 20:45:28,542 INFO L182 omatonBuilderFactory]: Interpolants [22080#false, 22208#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 22150#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 22151#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22193#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 22168#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22202#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 22203#(= 0 |#Ultimate.meminit_#t~loopctr33|), 22204#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 22205#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 22206#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 22079#true, 22207#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4))] [2018-02-04 20:45:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 184 proven. 10 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:28,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 20:45:28,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 20:45:28,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 20:45:28,542 INFO L87 Difference]: Start difference. First operand 218 states and 229 transitions. Second operand 13 states. [2018-02-04 20:45:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:29,124 INFO L93 Difference]: Finished difference Result 235 states and 247 transitions. [2018-02-04 20:45:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 20:45:29,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-02-04 20:45:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:29,125 INFO L225 Difference]: With dead ends: 235 [2018-02-04 20:45:29,125 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 20:45:29,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-02-04 20:45:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 20:45:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2018-02-04 20:45:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 20:45:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 230 transitions. [2018-02-04 20:45:29,128 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 230 transitions. Word has length 80 [2018-02-04 20:45:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:29,128 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 230 transitions. [2018-02-04 20:45:29,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 20:45:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 230 transitions. [2018-02-04 20:45:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 20:45:29,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:29,129 INFO L351 BasicCegarLoop]: trace histogram [37, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:29,129 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:29,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1809363862, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:29,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 218 proven. 15 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:29,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 20:45:29,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:29,299 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-04 20:45:29,299 INFO L182 omatonBuilderFactory]: Interpolants [22817#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 22792#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22827#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 22828#(= 0 |#Ultimate.meminit_#t~loopctr33|), 22829#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 22702#true, 22830#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 22703#false, 22831#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 22832#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 22833#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 22834#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 22774#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 22775#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 20:45:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 218 proven. 15 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:29,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 20:45:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 20:45:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 20:45:29,299 INFO L87 Difference]: Start difference. First operand 219 states and 230 transitions. Second operand 14 states. [2018-02-04 20:45:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:29,861 INFO L93 Difference]: Finished difference Result 236 states and 248 transitions. [2018-02-04 20:45:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 20:45:29,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-02-04 20:45:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:29,862 INFO L225 Difference]: With dead ends: 236 [2018-02-04 20:45:29,862 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 20:45:29,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 20:45:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 20:45:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-02-04 20:45:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 20:45:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 231 transitions. [2018-02-04 20:45:29,864 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 231 transitions. Word has length 81 [2018-02-04 20:45:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:29,864 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 231 transitions. [2018-02-04 20:45:29,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 20:45:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 231 transitions. [2018-02-04 20:45:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 20:45:29,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:29,865 INFO L351 BasicCegarLoop]: trace histogram [38, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:29,865 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash 466202094, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:29,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 252 proven. 21 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:30,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:30,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 20:45:30,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:30,024 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-04 20:45:30,024 INFO L182 omatonBuilderFactory]: Interpolants [23425#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23461#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 23334#true, 23462#(= 0 |#Ultimate.meminit_#t~loopctr33|), 23335#false, 23463#(= |#Ultimate.meminit_#t~loopctr33| |#Ultimate.meminit_#sizeOfFields|), 23464#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 23465#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 23466#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 23467#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 23468#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 23469#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 23407#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 23408#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23450#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 252 proven. 21 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:30,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 20:45:30,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 20:45:30,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 20:45:30,025 INFO L87 Difference]: Start difference. First operand 220 states and 231 transitions. Second operand 15 states. [2018-02-04 20:45:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:30,693 INFO L93 Difference]: Finished difference Result 237 states and 249 transitions. [2018-02-04 20:45:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 20:45:30,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-02-04 20:45:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:30,694 INFO L225 Difference]: With dead ends: 237 [2018-02-04 20:45:30,694 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 20:45:30,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 20:45:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 20:45:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2018-02-04 20:45:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 20:45:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 232 transitions. [2018-02-04 20:45:30,696 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 232 transitions. Word has length 82 [2018-02-04 20:45:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:30,697 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 232 transitions. [2018-02-04 20:45:30,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 20:45:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 232 transitions. [2018-02-04 20:45:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 20:45:30,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:30,697 INFO L351 BasicCegarLoop]: trace histogram [39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:30,697 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1777860246, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:30,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 286 proven. 28 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:30,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:30,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 20:45:30,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:30,879 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-04 20:45:30,879 INFO L182 omatonBuilderFactory]: Interpolants [24067#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23975#true, 23976#false, 24104#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 24105#(= 0 |#Ultimate.meminit_#t~loopctr33|), 24106#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 24107#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 24108#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 24109#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 24110#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 24111#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 24112#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 24049#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 24113#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9))), 24050#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24092#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296))] [2018-02-04 20:45:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 286 proven. 28 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:30,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 20:45:30,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 20:45:30,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 20:45:30,879 INFO L87 Difference]: Start difference. First operand 221 states and 232 transitions. Second operand 16 states. [2018-02-04 20:45:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:31,593 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2018-02-04 20:45:31,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 20:45:31,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-02-04 20:45:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:31,594 INFO L225 Difference]: With dead ends: 238 [2018-02-04 20:45:31,594 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 20:45:31,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 20:45:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 20:45:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 222. [2018-02-04 20:45:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 20:45:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 233 transitions. [2018-02-04 20:45:31,597 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 233 transitions. Word has length 83 [2018-02-04 20:45:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:31,598 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 233 transitions. [2018-02-04 20:45:31,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 20:45:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 233 transitions. [2018-02-04 20:45:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 20:45:31,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:31,599 INFO L351 BasicCegarLoop]: trace histogram [40, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:31,599 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -510410002, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:31,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 320 proven. 36 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:31,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 20:45:31,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 20:45:31,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:31,826 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-04 20:45:31,826 INFO L182 omatonBuilderFactory]: Interpolants [24743#(= (mod |ldv_zalloc_#in~size| 4294967296) (mod ldv_zalloc_~size 4294967296)), 24718#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24625#true, 24626#false, 24756#(not (= (mod |ldv_zalloc_#in~size| 4294967296) 9)), 24757#(= 0 |#Ultimate.meminit_#t~loopctr33|), 24758#(= |#Ultimate.meminit_#sizeOfFields| |#Ultimate.meminit_#t~loopctr33|), 24759#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 2)), 24760#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 3)), 24761#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 4)), 24762#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 5)), 24763#(or (<= |#Ultimate.meminit_#t~loopctr33| 6) (not (= |#Ultimate.meminit_#sizeOfFields| 1))), 24700#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 24764#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 7)), 24701#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24765#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr33| 8)), 24766#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (not (= |#Ultimate.meminit_#product| 9)))] [2018-02-04 20:45:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 320 proven. 36 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-02-04 20:45:31,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 20:45:31,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 20:45:31,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 20:45:31,827 INFO L87 Difference]: Start difference. First operand 222 states and 233 transitions. Second operand 17 states. [2018-02-04 20:45:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:32,629 INFO L93 Difference]: Finished difference Result 239 states and 251 transitions. [2018-02-04 20:45:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 20:45:32,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 20:45:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:32,630 INFO L225 Difference]: With dead ends: 239 [2018-02-04 20:45:32,630 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 20:45:32,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 20:45:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 20:45:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 223. [2018-02-04 20:45:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 20:45:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2018-02-04 20:45:32,633 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 84 [2018-02-04 20:45:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:32,633 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2018-02-04 20:45:32,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 20:45:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2018-02-04 20:45:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 20:45:32,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 20:45:32,633 INFO L351 BasicCegarLoop]: trace histogram [41, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 20:45:32,633 INFO L371 AbstractCegarLoop]: === Iteration 44 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-02-04 20:45:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1567656342, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-04 20:45:32,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 20:45:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,675 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-02-04 20:45:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,730 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:45:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,759 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-02-04 20:45:32,762 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,762 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,767 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,767 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,767 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,767 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,768 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-02-04 20:45:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 20:45:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-02-04 20:45:32,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 20:45:32,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 20:45:32,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 20:45:32,787 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-04 20:45:32,788 INFO L182 omatonBuilderFactory]: Interpolants [25362#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)), 25363#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25284#true, 25380#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25285#false, 25381#(= |#valid| |old(#valid)|), 25382#(= |#valid| (store |old(#valid)| |ldv_zalloc_#t~malloc1.base| 1)), 25341#(= 1 (select |#valid| |entry_point_#t~ret23.base|)), 25342#(= 1 (select |#valid| entry_point_~intf~2.base)), 25407#(= |#valid| (store |old(#valid)| |ldv_zalloc_#res.base| 1))] [2018-02-04 20:45:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-02-04 20:45:32,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 20:45:32,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 20:45:32,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 20:45:32,788 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand 10 states. [2018-02-04 20:45:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 20:45:32,888 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2018-02-04 20:45:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 20:45:32,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-02-04 20:45:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 20:45:32,889 INFO L225 Difference]: With dead ends: 9 [2018-02-04 20:45:32,889 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 20:45:32,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 20:45:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 20:45:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 20:45:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 20:45:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 20:45:32,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-02-04 20:45:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 20:45:32,890 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 20:45:32,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 20:45:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 20:45:32,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 20:45:32,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 08:45:32 BoogieIcfgContainer [2018-02-04 20:45:32,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 20:45:32,895 INFO L168 Benchmark]: Toolchain (without parser) took 43396.92 ms. Allocated memory was 409.5 MB in the beginning and 955.3 MB in the end (delta: 545.8 MB). Free memory was 365.9 MB in the beginning and 755.6 MB in the end (delta: -389.7 MB). Peak memory consumption was 156.1 MB. Max. memory is 5.3 GB. [2018-02-04 20:45:32,896 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 409.5 MB. Free memory is still 371.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 20:45:32,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.61 ms. Allocated memory is still 409.5 MB. Free memory was 365.9 MB in the beginning and 350.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 20:45:32,897 INFO L168 Benchmark]: Boogie Preprocessor took 32.57 ms. Allocated memory is still 409.5 MB. Free memory was 350.1 MB in the beginning and 347.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 20:45:32,897 INFO L168 Benchmark]: RCFGBuilder took 375.70 ms. Allocated memory is still 409.5 MB. Free memory was 347.4 MB in the beginning and 306.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. [2018-02-04 20:45:32,897 INFO L168 Benchmark]: TraceAbstraction took 42800.67 ms. Allocated memory was 409.5 MB in the beginning and 955.3 MB in the end (delta: 545.8 MB). Free memory was 306.4 MB in the beginning and 755.6 MB in the end (delta: -449.2 MB). Peak memory consumption was 96.6 MB. Max. memory is 5.3 GB. [2018-02-04 20:45:32,899 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.16 ms. Allocated memory is still 409.5 MB. Free memory is still 371.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 184.61 ms. Allocated memory is still 409.5 MB. Free memory was 365.9 MB in the beginning and 350.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.57 ms. Allocated memory is still 409.5 MB. Free memory was 350.1 MB in the beginning and 347.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 375.70 ms. Allocated memory is still 409.5 MB. Free memory was 347.4 MB in the beginning and 306.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42800.67 ms. Allocated memory was 409.5 MB in the beginning and 955.3 MB in the end (delta: 545.8 MB). Free memory was 306.4 MB in the beginning and 755.6 MB in the end (delta: -449.2 MB). Peak memory consumption was 96.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1533]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 165 locations, 45 error locations. SAFE Result, 42.7s OverallTime, 44 OverallIterations, 41 TraceHistogramMax, 33.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5382 SDtfs, 8414 SDslu, 31926 SDs, 0 SdLazy, 49146 SolverSat, 4098 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2253 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 1644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15041 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 12557/15333 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2764 NumberOfCodeBlocks, 2764 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2720 ConstructedInterpolants, 0 QuantifiedInterpolants, 638989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 4 PerfectInterpolantSequences, 12557/15333 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_20-45-32-907.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_20-45-32-907.csv Received shutdown request...