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_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:15:38,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:15:38,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:15:38,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:15:38,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:15:38,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:15:38,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:15:38,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:15:38,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:15:38,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:15:38,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:15:38,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:15:38,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:15:38,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:15:38,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:15:38,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:15:38,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:15:38,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:15:38,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:15:38,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:15:38,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:15:38,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:15:38,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:15:38,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:15:38,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:15:38,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:15:38,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:15:38,073 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:15:38,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:15:38,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:15:38,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:15:38,075 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:15:38,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:15:38,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:15:38,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:15:38,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:15:38,085 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:15:38,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:15:38,086 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:15:38,087 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:15:38,087 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:15:38,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:15:38,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:15:38,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:15:38,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:15:38,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:15:38,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:15:38,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:15:38,124 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:15:38,131 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:15:38,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:15:38,133 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:15:38,133 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-02 19:15:38,281 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:15:38,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:15:38,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:15:38,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:15:38,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:15:38,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38, skipping insertion in model container [2018-02-02 19:15:38,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,298 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:15:38,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:15:38,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:15:38,446 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:15:38,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38 WrapperNode [2018-02-02 19:15:38,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:15:38,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:15:38,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:15:38,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:15:38,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... [2018-02-02 19:15:38,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:15:38,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:15:38,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:15:38,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:15:38,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:15:38,524 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:15:38,524 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:15:38,524 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials_unsafe [2018-02-02 19:15:38,525 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-02-02 19:15:38,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe_unsafe [2018-02-02 19:15:38,526 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-02-02 19:15:38,526 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 19:15:38,526 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:15:38,526 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:15:38,526 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:15:38,526 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:15:38,526 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:15:38,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-02-02 19:15:38,527 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:15:38,527 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 19:15:38,528 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials_unsafe [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe_unsafe [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:15:38,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:15:38,893 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:15:38,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:15:38 BoogieIcfgContainer [2018-02-02 19:15:38,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:15:38,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:15:38,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:15:38,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:15:38,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:15:38" (1/3) ... [2018-02-02 19:15:38,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5380ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:15:38, skipping insertion in model container [2018-02-02 19:15:38,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:15:38" (2/3) ... [2018-02-02 19:15:38,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5380ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:15:38, skipping insertion in model container [2018-02-02 19:15:38,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:15:38" (3/3) ... [2018-02-02 19:15:38,899 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test15_false-valid-memtrack.i [2018-02-02 19:15:38,906 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:15:38,912 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 19:15:38,940 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:15:38,940 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:15:38,941 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:15:38,941 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:15:38,941 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:15:38,941 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:15:38,941 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:15:38,941 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:15:38,941 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:15:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-02-02 19:15:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:15:38,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:38,960 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-02 19:15:38,961 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-02 19:15:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 462743197, now seen corresponding path program 1 times [2018-02-02 19:15:38,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:38,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:38,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:38,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:38,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:39,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:15:39,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:15:39,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:15:39,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:15:39,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:15:39,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:15:39,218 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 6 states. [2018-02-02 19:15:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:39,273 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-02-02 19:15:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:15:39,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 19:15:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:39,282 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:15:39,282 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 19:15:39,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:15:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 19:15:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 19:15:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 19:15:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-02-02 19:15:39,317 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 22 [2018-02-02 19:15:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:39,319 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-02-02 19:15:39,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:15:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-02-02 19:15:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:15:39,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:39,321 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-02 19:15:39,321 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-02 19:15:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash -844495449, now seen corresponding path program 1 times [2018-02-02 19:15:39,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:39,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:39,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:39,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:39,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:39,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:39,397 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-02 19:15:39,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:15:39,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:15:39,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:15:39,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:15:39,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:15:39,398 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 6 states. [2018-02-02 19:15:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:39,470 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-02-02 19:15:39,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:15:39,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 19:15:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:39,472 INFO L225 Difference]: With dead ends: 162 [2018-02-02 19:15:39,472 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 19:15:39,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:15:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 19:15:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 19:15:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 19:15:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-02-02 19:15:39,482 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 33 [2018-02-02 19:15:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:39,482 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-02-02 19:15:39,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:15:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-02-02 19:15:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:15:39,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:39,483 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-02 19:15:39,483 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-02 19:15:39,483 INFO L82 PathProgramCache]: Analyzing trace with hash 902320110, now seen corresponding path program 1 times [2018-02-02 19:15:39,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:39,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:39,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:39,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:39,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:39,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 19:15:39,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:39,614 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:39,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:39,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:39,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:15:39,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:39,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:15:39,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:15:39,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:39,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 19:15:39,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:39,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:15:39,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 19:15:39,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:39,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:39,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:15:39,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:39,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:15:39,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 19:15:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 19:15:39,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:39,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-02-02 19:15:39,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:15:39,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:15:39,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:15:39,846 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 12 states. [2018-02-02 19:15:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:40,408 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2018-02-02 19:15:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:15:40,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-02-02 19:15:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:40,411 INFO L225 Difference]: With dead ends: 205 [2018-02-02 19:15:40,411 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 19:15:40,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:15:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 19:15:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 175. [2018-02-02 19:15:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 19:15:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2018-02-02 19:15:40,421 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 44 [2018-02-02 19:15:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:40,421 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2018-02-02 19:15:40,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:15:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2018-02-02 19:15:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:15:40,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:40,422 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-02 19:15:40,422 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-02 19:15:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 902320111, now seen corresponding path program 1 times [2018-02-02 19:15:40,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:40,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:40,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:40,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:40,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:40,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 19:15:40,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:40,581 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:40,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:40,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:15:40,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:15:40,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-02-02 19:15:40,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:15:40,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:15:40,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:15:40,668 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand 10 states. [2018-02-02 19:15:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:40,724 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-02-02 19:15:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:15:40,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-02-02 19:15:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:40,725 INFO L225 Difference]: With dead ends: 181 [2018-02-02 19:15:40,725 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 19:15:40,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:15:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 19:15:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-02-02 19:15:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 19:15:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-02-02 19:15:40,733 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 44 [2018-02-02 19:15:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:40,733 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-02-02 19:15:40,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:15:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-02-02 19:15:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:15:40,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:40,734 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-02 19:15:40,734 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-02 19:15:40,734 INFO L82 PathProgramCache]: Analyzing trace with hash -506792821, now seen corresponding path program 1 times [2018-02-02 19:15:40,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:40,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:40,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:40,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:40,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:40,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:40,870 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-02 19:15:40,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:40,871 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:40,878 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:40,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:15:40,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:40,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-02 19:15:40,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:15:40,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:15:40,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:15:40,999 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 12 states. [2018-02-02 19:15:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:41,073 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-02 19:15:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:15:41,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-02-02 19:15:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:41,074 INFO L225 Difference]: With dead ends: 182 [2018-02-02 19:15:41,074 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 19:15:41,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:15:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 19:15:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-02 19:15:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 19:15:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2018-02-02 19:15:41,078 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 47 [2018-02-02 19:15:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:41,078 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2018-02-02 19:15:41,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:15:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2018-02-02 19:15:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:15:41,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:41,084 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-02 19:15:41,084 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-02 19:15:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1284083601, now seen corresponding path program 2 times [2018-02-02 19:15:41,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:41,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:41,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:41,086 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:15:41,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:41,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 19:15:41,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:41,224 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:41,238 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:15:41,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:15:41,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:15:41,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 19:15:41,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:41,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-02-02 19:15:41,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:15:41,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:15:41,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:15:41,397 INFO L87 Difference]: Start difference. First operand 177 states and 194 transitions. Second operand 14 states. [2018-02-02 19:15:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:41,523 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2018-02-02 19:15:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:15:41,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 19:15:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:41,525 INFO L225 Difference]: With dead ends: 183 [2018-02-02 19:15:41,525 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 19:15:41,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:15:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 19:15:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 19:15:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 19:15:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 195 transitions. [2018-02-02 19:15:41,531 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 195 transitions. Word has length 50 [2018-02-02 19:15:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:41,532 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 195 transitions. [2018-02-02 19:15:41,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:15:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 195 transitions. [2018-02-02 19:15:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 19:15:41,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:41,533 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-02 19:15:41,533 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-02 19:15:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -202175989, now seen corresponding path program 3 times [2018-02-02 19:15:41,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:41,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:41,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:41,534 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:15:41,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:41,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 19:15:41,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:41,684 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:41,690 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:15:41,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 19:15:41,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:15:41,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 19:15:41,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:41,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-02-02 19:15:41,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:15:41,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:15:41,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:15:41,842 INFO L87 Difference]: Start difference. First operand 178 states and 195 transitions. Second operand 16 states. [2018-02-02 19:15:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:42,030 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2018-02-02 19:15:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:15:42,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-02 19:15:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:42,032 INFO L225 Difference]: With dead ends: 184 [2018-02-02 19:15:42,032 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 19:15:42,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:15:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 19:15:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-02-02 19:15:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 19:15:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 196 transitions. [2018-02-02 19:15:42,041 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 196 transitions. Word has length 53 [2018-02-02 19:15:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:42,041 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 196 transitions. [2018-02-02 19:15:42,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:15:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 196 transitions. [2018-02-02 19:15:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:15:42,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:42,042 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-02 19:15:42,042 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-02 19:15:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash -734121745, now seen corresponding path program 4 times [2018-02-02 19:15:42,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:42,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:42,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:42,049 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:15:42,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:42,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 19:15:42,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:42,269 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:42,273 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 19:15:43,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 19:15:43,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:15:43,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 100 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 19:15:43,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:43,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-02-02 19:15:43,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:15:43,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:15:43,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:15:43,118 INFO L87 Difference]: Start difference. First operand 179 states and 196 transitions. Second operand 18 states. [2018-02-02 19:15:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:43,325 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2018-02-02 19:15:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:15:43,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-02-02 19:15:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:43,326 INFO L225 Difference]: With dead ends: 185 [2018-02-02 19:15:43,327 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 19:15:43,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:15:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 19:15:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-02 19:15:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 19:15:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-02-02 19:15:43,331 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 56 [2018-02-02 19:15:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:43,332 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-02-02 19:15:43,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:15:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-02-02 19:15:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 19:15:43,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:43,332 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-02 19:15:43,332 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-02 19:15:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1514307467, now seen corresponding path program 5 times [2018-02-02 19:15:43,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:43,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:43,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:43,333 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:15:43,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:43,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 58 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 19:15:43,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:43,706 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:43,711 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 19:15:56,074 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-02 19:15:56,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:15:56,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 133 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 19:15:56,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:56,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-02-02 19:15:56,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:15:56,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:15:56,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:15:56,250 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 27 states. [2018-02-02 19:15:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:15:57,436 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2018-02-02 19:15:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:15:57,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-02-02 19:15:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:15:57,437 INFO L225 Difference]: With dead ends: 193 [2018-02-02 19:15:57,437 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 19:15:57,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:15:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 19:15:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-02-02 19:15:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 19:15:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2018-02-02 19:15:57,443 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 59 [2018-02-02 19:15:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:15:57,443 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2018-02-02 19:15:57,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:15:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2018-02-02 19:15:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 19:15:57,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:15:57,444 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-02 19:15:57,444 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-02 19:15:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -13135505, now seen corresponding path program 6 times [2018-02-02 19:15:57,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:15:57,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:15:57,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:57,445 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:15:57,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:15:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:15:57,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:15:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-02-02 19:15:57,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:15:57,645 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:15:57,650 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 19:15:57,760 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 19:15:57,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:15:57,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:15:57,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-02 19:15:57,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:57,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-02 19:15:57,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:57,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 19:15:57,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:57,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 19:15:57,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:57,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:15:57,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-02-02 19:15:58,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-02 19:15:58,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 19:15:58,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:15:58,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-02-02 19:15:58,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:15:58,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-02-02 19:15:58,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-02 19:15:58,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-02 19:15:58,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-02-02 19:15:58,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:15:58,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-02-02 19:15:58,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:15:58,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:15:58,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-02 19:15:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 116 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 19:15:58,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:15:58,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-02-02 19:15:58,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:15:58,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:15:58,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=576, Unknown=2, NotChecked=0, Total=650 [2018-02-02 19:15:58,555 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 26 states. [2018-02-02 19:16:02,111 WARN L143 SmtUtils]: Spent 170ms on a formula simplification that was a NOOP. DAG size: 57 [2018-02-02 19:16:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:03,731 INFO L93 Difference]: Finished difference Result 246 states and 266 transitions. [2018-02-02 19:16:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:16:03,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 19:16:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:03,733 INFO L225 Difference]: With dead ends: 246 [2018-02-02 19:16:03,733 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 19:16:03,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1969, Unknown=3, NotChecked=0, Total=2256 [2018-02-02 19:16:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 19:16:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2018-02-02 19:16:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 19:16:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2018-02-02 19:16:03,737 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 62 [2018-02-02 19:16:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:03,737 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2018-02-02 19:16:03,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:16:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2018-02-02 19:16:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 19:16:03,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:03,738 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, 1, 1, 1, 1, 1] [2018-02-02 19:16:03,738 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-02 19:16:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2002452483, now seen corresponding path program 1 times [2018-02-02 19:16:03,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:03,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:03,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:03,740 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:03,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:03,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-02-02 19:16:03,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:03,797 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:03,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:03,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-02-02 19:16:03,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:03,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 19:16:03,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:16:03,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:16:03,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:16:03,881 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand 6 states. [2018-02-02 19:16:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:03,896 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-02-02 19:16:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:16:03,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-02-02 19:16:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:03,897 INFO L225 Difference]: With dead ends: 194 [2018-02-02 19:16:03,897 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 19:16:03,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:16:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 19:16:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-02-02 19:16:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 19:16:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 19:16:03,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 70 [2018-02-02 19:16:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:03,902 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 19:16:03,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:16:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 19:16:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 19:16:03,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:03,903 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, 1, 1, 1, 1, 1] [2018-02-02 19:16:03,903 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-02 19:16:03,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2002452484, now seen corresponding path program 1 times [2018-02-02 19:16:03,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:03,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:03,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:03,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:03,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:03,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-02-02 19:16:03,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:03,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:16:03,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:16:03,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:16:03,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:16:03,960 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 7 states. [2018-02-02 19:16:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:04,026 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-02-02 19:16:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:16:04,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-02-02 19:16:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:04,028 INFO L225 Difference]: With dead ends: 193 [2018-02-02 19:16:04,028 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 19:16:04,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:16:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 19:16:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-02 19:16:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 19:16:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2018-02-02 19:16:04,034 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 70 [2018-02-02 19:16:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:04,035 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2018-02-02 19:16:04,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:16:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2018-02-02 19:16:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 19:16:04,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:04,036 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, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:04,036 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-02 19:16:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1946516685, now seen corresponding path program 1 times [2018-02-02 19:16:04,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:04,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:04,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:04,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:04,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:04,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-02-02 19:16:04,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:16:04,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:16:04,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:16:04,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:16:04,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:16:04,117 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand 7 states. [2018-02-02 19:16:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:04,270 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-02-02 19:16:04,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:16:04,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-02-02 19:16:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:04,271 INFO L225 Difference]: With dead ends: 192 [2018-02-02 19:16:04,271 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 19:16:04,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:16:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 19:16:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-02-02 19:16:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 19:16:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 217 transitions. [2018-02-02 19:16:04,276 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 217 transitions. Word has length 71 [2018-02-02 19:16:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:04,277 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 217 transitions. [2018-02-02 19:16:04,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:16:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-02-02 19:16:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 19:16:04,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:04,278 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, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:04,278 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-02 19:16:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1946516686, now seen corresponding path program 1 times [2018-02-02 19:16:04,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:04,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:04,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:04,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:04,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:04,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 19:16:04,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:04,520 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:04,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:04,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:04,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 19:16:04,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:04,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 19:16:04,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:04,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 19:16:04,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:04,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 19:16:04,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:04,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:04,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:16:05,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-02 19:16:05,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:05,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 19:16:05,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:05,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-02-02 19:16:05,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:05,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:16:05,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:05,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:16:05,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-02-02 19:16:07,469 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-02 19:16:11,559 WARN L146 SmtUtils]: Spent 4033ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-02-02 19:16:11,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-02 19:16:11,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2018-02-02 19:16:11,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-02-02 19:16:11,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-02-02 19:16:11,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2018-02-02 19:16:11,818 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-02-02 19:16:11,867 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-02 19:16:11,918 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:11,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 19:16:11,960 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:11,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-02 19:16:11,999 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:209, output treesize:163 [2018-02-02 19:16:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 146 proven. 99 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 19:16:12,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:12,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 34 [2018-02-02 19:16:12,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:16:12,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:16:12,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1019, Unknown=4, NotChecked=0, Total=1122 [2018-02-02 19:16:12,216 INFO L87 Difference]: Start difference. First operand 192 states and 217 transitions. Second operand 34 states. [2018-02-02 19:16:15,382 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-02-02 19:16:15,670 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-02-02 19:16:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:20,115 INFO L93 Difference]: Finished difference Result 235 states and 254 transitions. [2018-02-02 19:16:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:16:20,116 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2018-02-02 19:16:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:20,117 INFO L225 Difference]: With dead ends: 235 [2018-02-02 19:16:20,117 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 19:16:20,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=251, Invalid=2295, Unknown=4, NotChecked=0, Total=2550 [2018-02-02 19:16:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 19:16:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2018-02-02 19:16:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 19:16:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-02-02 19:16:20,121 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 71 [2018-02-02 19:16:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:20,121 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2018-02-02 19:16:20,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:16:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-02-02 19:16:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 19:16:20,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:20,121 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, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:20,121 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-02 19:16:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash 395214514, now seen corresponding path program 2 times [2018-02-02 19:16:20,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:20,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:20,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:20,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:20,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:20,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 174 proven. 36 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-02 19:16:20,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:20,377 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:20,384 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:16:20,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:16:20,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:20,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:20,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 19:16:20,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:20,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 19:16:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:20,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:20,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 19:16:21,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:16:21,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:21,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:16:21,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:21,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:21,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:64, output treesize:44 [2018-02-02 19:16:21,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-02 19:16:21,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-02-02 19:16:21,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 19:16:21,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:16:21,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:21,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:21,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:62, output treesize:32 [2018-02-02 19:16:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-02-02 19:16:21,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:21,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-02 19:16:21,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:16:21,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:16:21,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:16:21,484 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand 33 states. [2018-02-02 19:16:24,069 WARN L146 SmtUtils]: Spent 2209ms on a formula simplification. DAG size of input: 86 DAG size of output 44 [2018-02-02 19:16:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:24,995 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2018-02-02 19:16:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:16:24,995 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-02-02 19:16:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:24,996 INFO L225 Difference]: With dead ends: 196 [2018-02-02 19:16:24,996 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 19:16:24,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:16:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 19:16:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-02-02 19:16:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 19:16:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2018-02-02 19:16:25,003 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 74 [2018-02-02 19:16:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:25,003 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2018-02-02 19:16:25,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:16:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2018-02-02 19:16:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 19:16:25,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:25,004 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:25,004 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-02 19:16:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1844027634, now seen corresponding path program 1 times [2018-02-02 19:16:25,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:25,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:25,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,006 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:25,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:25,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-02-02 19:16:25,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:25,222 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:25,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:25,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:16:25,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:16:25,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 19:16:25,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 19:16:25,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:16:25,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 19:16:25,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 19:16:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 19:16:25,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:25,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-02 19:16:25,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:28 [2018-02-02 19:16:25,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:16:25,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:25,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:25,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:46 [2018-02-02 19:16:25,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-02-02 19:16:25,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-02-02 19:16:25,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:25,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:28 [2018-02-02 19:16:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-02-02 19:16:25,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:25,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2018-02-02 19:16:25,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:16:25,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:16:25,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:16:25,617 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand 21 states. [2018-02-02 19:16:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:26,446 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2018-02-02 19:16:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:16:26,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 19:16:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:26,447 INFO L225 Difference]: With dead ends: 211 [2018-02-02 19:16:26,447 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 19:16:26,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:16:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 19:16:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2018-02-02 19:16:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 19:16:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-02-02 19:16:26,450 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 76 [2018-02-02 19:16:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:26,450 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-02-02 19:16:26,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:16:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-02-02 19:16:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 19:16:26,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:26,451 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:26,451 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-02 19:16:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1844027635, now seen corresponding path program 1 times [2018-02-02 19:16:26,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:26,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:26,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-02-02 19:16:26,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:26,703 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:26,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:26,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:26,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 19:16:26,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:26,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 19:16:26,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:26,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 19:16:26,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:26,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 19:16:26,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:26,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:26,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:16:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 269 proven. 36 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-02-02 19:16:27,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:27,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-02-02 19:16:27,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:16:27,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:16:27,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:16:27,652 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 30 states. [2018-02-02 19:16:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:29,520 INFO L93 Difference]: Finished difference Result 227 states and 245 transitions. [2018-02-02 19:16:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:16:29,520 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2018-02-02 19:16:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:29,521 INFO L225 Difference]: With dead ends: 227 [2018-02-02 19:16:29,521 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 19:16:29,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:16:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 19:16:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2018-02-02 19:16:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 19:16:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2018-02-02 19:16:29,525 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 76 [2018-02-02 19:16:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:29,525 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2018-02-02 19:16:29,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:16:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2018-02-02 19:16:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 19:16:29,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:29,526 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:29,526 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-02 19:16:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 10632591, now seen corresponding path program 2 times [2018-02-02 19:16:29,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:29,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:29,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:29,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:16:29,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:29,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 107 proven. 152 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 19:16:29,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:29,839 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:29,847 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:16:29,907 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:16:29,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:29,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 218 proven. 45 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-02-02 19:16:30,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:30,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-02-02 19:16:30,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:16:30,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:16:30,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:16:30,216 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand 28 states. [2018-02-02 19:16:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:16:31,078 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2018-02-02 19:16:31,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:16:31,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-02-02 19:16:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:16:31,079 INFO L225 Difference]: With dead ends: 217 [2018-02-02 19:16:31,079 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 19:16:31,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=2140, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:16:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 19:16:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 19:16:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 19:16:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 244 transitions. [2018-02-02 19:16:31,084 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 244 transitions. Word has length 79 [2018-02-02 19:16:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:16:31,084 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 244 transitions. [2018-02-02 19:16:31,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:16:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 244 transitions. [2018-02-02 19:16:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:16:31,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:16:31,085 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:16:31,085 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-02 19:16:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash 826541595, now seen corresponding path program 3 times [2018-02-02 19:16:31,086 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:16:31,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:16:31,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:31,087 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:16:31,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:16:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:16:31,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:16:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-02-02 19:16:31,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:16:31,455 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:16:31,462 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 19:16:31,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 19:16:31,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:16:31,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:16:31,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 19:16:31,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 19:16:31,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 19:16:31,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 19:16:31,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:16:31,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 19:16:31,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-02-02 19:16:31,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-02 19:16:31,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 19:16:31,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-02-02 19:16:31,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:16:31,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:39 [2018-02-02 19:16:31,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-02-02 19:16:31,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:31,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:31,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-02 19:16:31,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 19:16:32,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-02-02 19:16:32,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 19:16:32,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:79, output treesize:69 [2018-02-02 19:16:32,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 19:16:32,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-02-02 19:16:32,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-02 19:16:32,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 19:16:32,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 19:16:32,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-02-02 19:16:32,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-02-02 19:16:32,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-02-02 19:16:32,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 82 [2018-02-02 19:16:32,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-02-02 19:16:32,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-02-02 19:16:32,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-02-02 19:16:32,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 67 [2018-02-02 19:16:32,770 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:16:32,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 63 [2018-02-02 19:16:32,823 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:32,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-02-02 19:16:32,870 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:213, output treesize:165 [2018-02-02 19:16:35,027 WARN L143 SmtUtils]: Spent 2097ms on a formula simplification that was a NOOP. DAG size: 75 [2018-02-02 19:16:35,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-02-02 19:16:35,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:35,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-02-02 19:16:35,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:35,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-02-02 19:16:35,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:35,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-02-02 19:16:35,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:16:35,243 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,251 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:16:35,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-02-02 19:16:35,296 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:217, output treesize:213 [2018-02-02 19:16:35,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-02-02 19:16:35,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-02 19:16:35,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-02 19:16:35,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-02-02 19:16:35,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-02-02 19:16:35,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-02 19:16:35,545 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-02-02 19:16:35,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-02 19:16:35,598 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,606 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:16:35,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-02 19:16:35,670 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 20 variables, input treesize:213, output treesize:165 [2018-02-02 19:16:56,722 WARN L146 SmtUtils]: Spent 16964ms on a formula simplification. DAG size of input: 91 DAG size of output 71 [2018-02-02 19:16:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-02-02 19:16:56,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:16:56,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-02-02 19:16:56,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:16:56,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:16:56,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1023, Unknown=3, NotChecked=0, Total=1122 [2018-02-02 19:16:56,777 INFO L87 Difference]: Start difference. First operand 217 states and 244 transitions. Second operand 34 states. [2018-02-02 19:17:04,513 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 85 DAG size of output 59 [2018-02-02 19:17:06,698 WARN L146 SmtUtils]: Spent 2108ms on a formula simplification. DAG size of input: 114 DAG size of output 80 Received shutdown request... [2018-02-02 19:17:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:17:12,320 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:17:12,324 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:17:12,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:17:12 BoogieIcfgContainer [2018-02-02 19:17:12,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:17:12,325 INFO L168 Benchmark]: Toolchain (without parser) took 94044.07 ms. Allocated memory was 399.0 MB in the beginning and 847.2 MB in the end (delta: 448.3 MB). Free memory was 355.9 MB in the beginning and 558.5 MB in the end (delta: -202.6 MB). Peak memory consumption was 245.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:17:12,326 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:17:12,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.29 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 341.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:17:12,327 INFO L168 Benchmark]: Boogie Preprocessor took 31.85 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 338.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:17:12,327 INFO L168 Benchmark]: RCFGBuilder took 405.75 ms. Allocated memory is still 399.0 MB. Free memory was 338.4 MB in the beginning and 297.7 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:17:12,327 INFO L168 Benchmark]: TraceAbstraction took 93430.64 ms. Allocated memory was 399.0 MB in the beginning and 847.2 MB in the end (delta: 448.3 MB). Free memory was 297.7 MB in the beginning and 558.5 MB in the end (delta: -260.8 MB). Peak memory consumption was 187.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:17:12,328 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.29 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 341.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.85 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 338.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 405.75 ms. Allocated memory is still 399.0 MB. Free memory was 338.4 MB in the beginning and 297.7 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 93430.64 ms. Allocated memory was 399.0 MB in the beginning and 847.2 MB in the end (delta: 448.3 MB). Free memory was 297.7 MB in the beginning and 558.5 MB in the end (delta: -260.8 MB). Peak memory consumption was 187.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (217states) and interpolant automaton (currently 31 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 92. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 165 locations, 45 error locations. TIMEOUT Result, 93.3s OverallTime, 19 OverallIterations, 29 TraceHistogramMax, 38.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2575 SDtfs, 1899 SDslu, 25774 SDs, 0 SdLazy, 16746 SolverSat, 592 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1297 GetRequests, 809 SyntacticMatches, 27 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 46.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 13.9s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 2080 NumberOfCodeBlocks, 2029 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2046 ConstructedInterpolants, 232 QuantifiedInterpolants, 1051158 SizeOfPredicates, 64 NumberOfNonLiveVariables, 4417 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 5896/7680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-17-12-333.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-17-12-333.csv Completed graceful shutdown