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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test12_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:01:53,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:01:53,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:01:53,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:01:53,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:01:53,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:01:53,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:01:53,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:01:53,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:01:53,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:01:53,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:01:53,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:01:53,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:01:53,251 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:01:53,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:01:53,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:01:53,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:01:53,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:01:53,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:01:53,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:01:53,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:01:53,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:01:53,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:01:53,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:01:53,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:01:53,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:01:53,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:01:53,268 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:01:53,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:01:53,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:01:53,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:01:53,270 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:01:53,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:01:53,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:01:53,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:01:53,281 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:01:53,281 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:01:53,281 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:01:53,282 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:01:53,282 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:01:53,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:01:53,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:01:53,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:01:53,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:01:53,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:01:53,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:01:53,284 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:01:53,284 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:01:53,284 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:01:53,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:01:53,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:01:53,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:01:53,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:01:53,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:01:53,285 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:01:53,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:01:53,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:53,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:01:53,286 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:01:53,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:01:53,286 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:01:53,286 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:01:53,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:01:53,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:01:53,287 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:01:53,287 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:01:53,288 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:01:53,288 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:01:53,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:01:53,337 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:01:53,341 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:01:53,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:01:53,343 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:01:53,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test12_false-valid-free.i [2018-01-25 06:01:53,552 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:01:53,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:01:53,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:53,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:01:53,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:01:53,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d57e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53, skipping insertion in model container [2018-01-25 06:01:53,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,579 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:53,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:53,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:53,820 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:53,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53 WrapperNode [2018-01-25 06:01:53,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:53,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:01:53,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:01:53,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:01:53,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... [2018-01-25 06:01:53,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:01:53,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:01:53,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:01:53,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:01:53,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (1/1) ... No working directory specified, using /storage/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-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:53,938 INFO L136 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2018-01-25 06:01:53,939 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-25 06:01:53,940 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure master_xfer [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_transfer [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_m88ts2022_rd_reg [2018-01-25 06:01:53,941 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_12 [2018-01-25 06:01:53,942 INFO L136 BoogieDeclarations]: Found implementation of procedure free_12 [2018-01-25 06:01:53,942 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:01:53,942 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:01:53,942 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:01:53,942 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:01:53,943 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-25 06:01:53,943 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:01:53,944 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2018-01-25 06:01:53,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure master_xfer [2018-01-25 06:01:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_transfer [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_m88ts2022_rd_reg [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_12 [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure free_12 [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:01:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:01:54,862 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 06:01:54,993 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:01:54,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:54 BoogieIcfgContainer [2018-01-25 06:01:54,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:01:54,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:01:54,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:01:54,997 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:01:54,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:01:53" (1/3) ... [2018-01-25 06:01:54,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fad89af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:54, skipping insertion in model container [2018-01-25 06:01:54,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:53" (2/3) ... [2018-01-25 06:01:54,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fad89af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:54, skipping insertion in model container [2018-01-25 06:01:54,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:54" (3/3) ... [2018-01-25 06:01:55,001 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test12_false-valid-free.i [2018-01-25 06:01:55,008 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:01:55,016 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-01-25 06:01:55,064 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:01:55,064 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:01:55,064 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:01:55,064 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:01:55,064 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:01:55,064 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:01:55,065 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:01:55,065 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:01:55,065 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:01:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states. [2018-01-25 06:01:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 06:01:55,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:55,096 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 06:01:55,096 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash 18685926, now seen corresponding path program 1 times [2018-01-25 06:01:55,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:55,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:55,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:55,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:55,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:55,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:01:55,348 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:55,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:01:55,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:01:55,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:55,363 INFO L87 Difference]: Start difference. First operand 398 states. Second operand 3 states. [2018-01-25 06:01:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:55,780 INFO L93 Difference]: Finished difference Result 668 states and 724 transitions. [2018-01-25 06:01:55,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:01:55,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 06:01:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:55,804 INFO L225 Difference]: With dead ends: 668 [2018-01-25 06:01:55,804 INFO L226 Difference]: Without dead ends: 481 [2018-01-25 06:01:55,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-01-25 06:01:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 436. [2018-01-25 06:01:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-01-25 06:01:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 491 transitions. [2018-01-25 06:01:55,897 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 491 transitions. Word has length 4 [2018-01-25 06:01:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:55,897 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 491 transitions. [2018-01-25 06:01:55,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:01:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 491 transitions. [2018-01-25 06:01:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 06:01:55,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:55,898 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 06:01:55,898 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash 18685927, now seen corresponding path program 1 times [2018-01-25 06:01:55,899 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:55,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:55,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:55,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:55,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:55,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:01:55,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:55,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:01:55,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:01:55,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:55,969 INFO L87 Difference]: Start difference. First operand 436 states and 491 transitions. Second operand 3 states. [2018-01-25 06:01:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:56,199 INFO L93 Difference]: Finished difference Result 570 states and 656 transitions. [2018-01-25 06:01:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:01:56,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 06:01:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:56,204 INFO L225 Difference]: With dead ends: 570 [2018-01-25 06:01:56,204 INFO L226 Difference]: Without dead ends: 567 [2018-01-25 06:01:56,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-01-25 06:01:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 497. [2018-01-25 06:01:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-01-25 06:01:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 602 transitions. [2018-01-25 06:01:56,247 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 602 transitions. Word has length 4 [2018-01-25 06:01:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:56,247 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 602 transitions. [2018-01-25 06:01:56,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:01:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 602 transitions. [2018-01-25 06:01:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:01:56,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:56,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:56,248 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2098584656, now seen corresponding path program 1 times [2018-01-25 06:01:56,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:56,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:56,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:56,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:56,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:56,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:56,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:56,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:56,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:56,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:56,350 INFO L87 Difference]: Start difference. First operand 497 states and 602 transitions. Second operand 6 states. [2018-01-25 06:01:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:56,492 INFO L93 Difference]: Finished difference Result 624 states and 762 transitions. [2018-01-25 06:01:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:56,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 06:01:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:56,497 INFO L225 Difference]: With dead ends: 624 [2018-01-25 06:01:56,497 INFO L226 Difference]: Without dead ends: 543 [2018-01-25 06:01:56,499 INFO L525 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-01-25 06:01:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-25 06:01:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 496. [2018-01-25 06:01:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-01-25 06:01:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 604 transitions. [2018-01-25 06:01:56,530 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 604 transitions. Word has length 21 [2018-01-25 06:01:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:56,531 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 604 transitions. [2018-01-25 06:01:56,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 604 transitions. [2018-01-25 06:01:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:01:56,532 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:56,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:56,532 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1744465714, now seen corresponding path program 1 times [2018-01-25 06:01:56,533 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:56,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:56,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,535 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:56,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:56,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:56,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:01:56,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:56,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:01:56,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:01:56,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:56,652 INFO L87 Difference]: Start difference. First operand 496 states and 604 transitions. Second operand 5 states. [2018-01-25 06:01:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:57,087 INFO L93 Difference]: Finished difference Result 572 states and 705 transitions. [2018-01-25 06:01:57,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:57,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 06:01:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:57,127 INFO L225 Difference]: With dead ends: 572 [2018-01-25 06:01:57,127 INFO L226 Difference]: Without dead ends: 571 [2018-01-25 06:01:57,128 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-25 06:01:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 538. [2018-01-25 06:01:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-01-25 06:01:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 661 transitions. [2018-01-25 06:01:57,155 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 661 transitions. Word has length 21 [2018-01-25 06:01:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:57,155 INFO L432 AbstractCegarLoop]: Abstraction has 538 states and 661 transitions. [2018-01-25 06:01:57,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:01:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 661 transitions. [2018-01-25 06:01:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:01:57,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:57,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:57,157 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1744465713, now seen corresponding path program 1 times [2018-01-25 06:01:57,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:57,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:57,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:57,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:57,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:57,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:57,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:57,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:57,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:57,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:01:57,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:01:57,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:01:57,325 INFO L87 Difference]: Start difference. First operand 538 states and 661 transitions. Second operand 7 states. [2018-01-25 06:01:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:58,785 INFO L93 Difference]: Finished difference Result 669 states and 772 transitions. [2018-01-25 06:01:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:01:58,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 06:01:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:58,789 INFO L225 Difference]: With dead ends: 669 [2018-01-25 06:01:58,790 INFO L226 Difference]: Without dead ends: 668 [2018-01-25 06:01:58,790 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:01:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-01-25 06:01:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 538. [2018-01-25 06:01:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-01-25 06:01:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 660 transitions. [2018-01-25 06:01:58,831 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 660 transitions. Word has length 21 [2018-01-25 06:01:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:58,832 INFO L432 AbstractCegarLoop]: Abstraction has 538 states and 660 transitions. [2018-01-25 06:01:58,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:01:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 660 transitions. [2018-01-25 06:01:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:01:58,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:58,834 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:58,834 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:01:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1603523080, now seen corresponding path program 1 times [2018-01-25 06:01:58,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:58,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:58,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:58,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:58,836 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:58,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 06:01:58,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:58,920 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:58,921 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 06:01:58,923 INFO L201 CegarAbsIntRunner]: [202], [207], [209], [212], [277], [479], [485], [486], [487], [488], [489], [492], [495], [516], [538], [539], [540], [541], [580], [581], [582] [2018-01-25 06:01:58,983 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:58,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:02:03,065 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:02:03,067 INFO L268 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-25 06:02:03,076 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:02:04,183 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 90.06% of their original sizes. [2018-01-25 06:02:04,184 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:02:04,249 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:02:04,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:02:04,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-01-25 06:02:04,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:04,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:02:04,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:02:04,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:02:04,252 INFO L87 Difference]: Start difference. First operand 538 states and 660 transitions. Second operand 9 states. [2018-01-25 06:02:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:17,457 INFO L93 Difference]: Finished difference Result 1062 states and 1246 transitions. [2018-01-25 06:02:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:02:17,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-25 06:02:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:17,461 INFO L225 Difference]: With dead ends: 1062 [2018-01-25 06:02:17,461 INFO L226 Difference]: Without dead ends: 546 [2018-01-25 06:02:17,464 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:02:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-01-25 06:02:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 501. [2018-01-25 06:02:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-01-25 06:02:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 579 transitions. [2018-01-25 06:02:17,508 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 579 transitions. Word has length 24 [2018-01-25 06:02:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:17,508 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 579 transitions. [2018-01-25 06:02:17,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:02:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 579 transitions. [2018-01-25 06:02:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:02:17,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:17,509 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:17,510 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, alloc_12Err2RequiresViolation, alloc_12Err13RequiresViolation, alloc_12Err14RequiresViolation, alloc_12Err6RequiresViolation, alloc_12Err7RequiresViolation, alloc_12Err4RequiresViolation, alloc_12Err11RequiresViolation, alloc_12Err0RequiresViolation, alloc_12Err9RequiresViolation, alloc_12Err5RequiresViolation, alloc_12Err15RequiresViolation, alloc_12Err1RequiresViolation, alloc_12Err10RequiresViolation, alloc_12Err8RequiresViolation, alloc_12Err3RequiresViolation, alloc_12Err12RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, 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_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-25 06:02:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1679705302, now seen corresponding path program 1 times [2018-01-25 06:02:17,510 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:17,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:17,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:17,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:17,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:17,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 06:02:17,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:17,577 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:17,577 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 06:02:17,577 INFO L201 CegarAbsIntRunner]: [202], [207], [209], [212], [277], [479], [482], [483], [484], [485], [486], [487], [488], [489], [492], [495], [516], [538], [539], [540], [541], [580], [581], [582] [2018-01-25 06:02:17,578 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:02:17,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:02:20,406 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:02:20,406 INFO L268 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 06:02:20,410 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:02:21,741 INFO L232 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 84.15% of their original sizes. [2018-01-25 06:02:21,741 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:02:21,817 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:02:21,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:02:21,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 18 [2018-01-25 06:02:21,818 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:21,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:02:21,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:02:21,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:02:21,818 INFO L87 Difference]: Start difference. First operand 501 states and 579 transitions. Second operand 15 states. Received shutdown request... [2018-01-25 06:02:37,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-25 06:02:37,378 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:02:37,385 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:02:37,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:02:37 BoogieIcfgContainer [2018-01-25 06:02:37,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:02:37,386 INFO L168 Benchmark]: Toolchain (without parser) took 43834.20 ms. Allocated memory was 302.5 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 259.4 MB in the beginning and 383.3 MB in the end (delta: -123.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-25 06:02:37,387 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:02:37,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.83 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 242.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:37,388 INFO L168 Benchmark]: Boogie Preprocessor took 52.00 ms. Allocated memory is still 302.5 MB. Free memory was 242.4 MB in the beginning and 239.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:37,388 INFO L168 Benchmark]: RCFGBuilder took 1103.78 ms. Allocated memory was 302.5 MB in the beginning and 326.6 MB in the end (delta: 24.1 MB). Free memory was 239.4 MB in the beginning and 258.1 MB in the end (delta: -18.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:37,388 INFO L168 Benchmark]: TraceAbstraction took 42391.18 ms. Allocated memory was 326.6 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 258.1 MB in the beginning and 383.3 MB in the end (delta: -125.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-25 06:02:37,390 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.21 ms. Allocated memory is still 302.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 279.83 ms. Allocated memory is still 302.5 MB. Free memory was 259.4 MB in the beginning and 242.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.00 ms. Allocated memory is still 302.5 MB. Free memory was 242.4 MB in the beginning and 239.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1103.78 ms. Allocated memory was 302.5 MB in the beginning and 326.6 MB in the end (delta: 24.1 MB). Free memory was 239.4 MB in the beginning and 258.1 MB in the end (delta: -18.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42391.18 ms. Allocated memory was 326.6 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 258.1 MB in the beginning and 383.3 MB in the end (delta: -125.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 12 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 171 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.084096 RENAME_VARIABLES(MILLISECONDS) : 0.808683 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.375923 PROJECTAWAY(MILLISECONDS) : 0.013144 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.082149 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.834594 ADD_EQUALITY(MILLISECONDS) : 0.012718 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005757 #CONJOIN_DISJUNCTIVE : 32 #RENAME_VARIABLES : 47 #UNFREEZE : 0 #CONJOIN : 95 #PROJECTAWAY : 48 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 46 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 12 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 235 LocStat_NO_SUPPORTING_DISEQUALITIES : 130 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 77 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.335210 RENAME_VARIABLES(MILLISECONDS) : 0.828380 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.312873 PROJECTAWAY(MILLISECONDS) : 0.130295 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.026130 DISJOIN(MILLISECONDS) : 4.175720 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.853027 ADD_EQUALITY(MILLISECONDS) : 0.006225 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008494 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 126 #UNFREEZE : 0 #CONJOIN : 157 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 85 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1121). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1121). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1157). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1157). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1542). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1559). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1563). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1541). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1546). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1563). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1541). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1546). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1542). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1559). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1116). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1115). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1115). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1116). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1164). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1164). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1619]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1619). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1512). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1512). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1110). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1107). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1110). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1107). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1108). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1109). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1109). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1108). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1508). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1508). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1569). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1574). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1570). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1570). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1569). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1574). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1571). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1571). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1592). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1609). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1613). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1584). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1584). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1607). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1613). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1597). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1599). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1605). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1588). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1611). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1597). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1607). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1609). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1611). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1592). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1588). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1599). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1605). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1146). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1146). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (270 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 416 locations, 141 error locations. TIMEOUT Result, 42.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2304 SDtfs, 2003 SDslu, 5677 SDs, 0 SdLazy, 2171 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=538occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.9s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9498084908011378 AbsIntWeakeningRatio, 0.875 AbsIntAvgWeakeningVarsNumRemoved, 10.708333333333334 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 370 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 12790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-02-37-402.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-02-37-402.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-02-37-402.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-02-37-402.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-02-37-402.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-02-37-402.csv Completed graceful shutdown