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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:07:33,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:07:33,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:07:33,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:07:33,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:07:33,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:07:33,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:07:33,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:07:33,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:07:33,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:07:33,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:07:33,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:07:33,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:07:33,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:07:33,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:07:33,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:07:33,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:07:33,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:07:33,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:07:33,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:07:33,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:07:33,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:07:33,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:07:33,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:07:33,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:07:33,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:07:33,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:07:33,415 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:07:33,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:07:33,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:07:33,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:07:33,417 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_precise.epf [2018-01-25 00:07:33,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:07:33,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:07:33,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:07:33,429 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:07:33,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:07:33,429 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:07:33,430 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:07:33,430 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:07:33,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:07:33,431 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:07:33,432 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:07:33,432 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:07:33,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:07:33,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:07:33,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:07:33,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:07:33,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:07:33,433 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:07:33,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:07:33,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:07:33,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:07:33,434 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:07:33,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:07:33,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:07:33,434 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:07:33,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:07:33,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:07:33,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:07:33,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:07:33,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:07:33,436 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:07:33,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:07:33,483 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:07:33,487 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:07:33,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:07:33,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:07:33,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-25 00:07:33,679 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:07:33,684 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:07:33,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:07:33,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:07:33,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:07:33,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aa47da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33, skipping insertion in model container [2018-01-25 00:07:33,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,707 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:07:33,756 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:07:33,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:07:33,914 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:07:33,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33 WrapperNode [2018-01-25 00:07:33,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:07:33,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:07:33,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:07:33,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:07:33,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (1/1) ... [2018-01-25 00:07:33,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:07:33,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:07:33,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:07:33,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:07:33,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (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 00:07:34,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:07:34,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:07:34,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-25 00:07:34,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-25 00:07:34,021 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:07:34,022 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:07:34,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:07:34,024 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:07:34,024 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-25 00:07:34,024 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-25 00:07:34,024 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:07:34,024 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-25 00:07:34,025 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-25 00:07:34,026 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-01-25 00:07:34,027 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-25 00:07:34,027 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:07:34,027 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:07:34,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:07:34,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:07:34,539 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:07:34,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:07:34 BoogieIcfgContainer [2018-01-25 00:07:34,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:07:34,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:07:34,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:07:34,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:07:34,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:07:33" (1/3) ... [2018-01-25 00:07:34,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a14f372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:07:34, skipping insertion in model container [2018-01-25 00:07:34,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:07:33" (2/3) ... [2018-01-25 00:07:34,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a14f372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:07:34, skipping insertion in model container [2018-01-25 00:07:34,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:07:34" (3/3) ... [2018-01-25 00:07:34,548 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-25 00:07:34,558 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:07:34,565 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-25 00:07:34,617 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:07:34,618 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:07:34,618 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:07:34,618 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:07:34,618 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:07:34,618 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:07:34,618 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:07:34,619 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:07:34,619 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:07:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-01-25 00:07:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 00:07:34,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:34,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:07:34,652 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-01-25 00:07:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash -26265707, now seen corresponding path program 1 times [2018-01-25 00:07:34,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:34,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:34,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:34,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:34,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:34,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:34,878 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 00:07:34,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:34,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:07:34,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:34,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:07:34,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:07:34,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:07:34,989 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2018-01-25 00:07:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:35,268 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2018-01-25 00:07:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:07:35,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-25 00:07:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:35,315 INFO L225 Difference]: With dead ends: 231 [2018-01-25 00:07:35,315 INFO L226 Difference]: Without dead ends: 224 [2018-01-25 00:07:35,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:07:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-25 00:07:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-01-25 00:07:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-25 00:07:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-01-25 00:07:35,377 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 16 [2018-01-25 00:07:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:35,378 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-01-25 00:07:35,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:07:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-01-25 00:07:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 00:07:35,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:35,380 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:07:35,380 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-01-25 00:07:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash -325108585, now seen corresponding path program 1 times [2018-01-25 00:07:35,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:35,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:35,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:35,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:35,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:35,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:35,474 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 00:07:35,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:07:35,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:07:35,474 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:35,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:07:35,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:07:35,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:07:35,477 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 6 states. [2018-01-25 00:07:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:35,562 INFO L93 Difference]: Finished difference Result 219 states and 244 transitions. [2018-01-25 00:07:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:07:35,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 00:07:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:35,566 INFO L225 Difference]: With dead ends: 219 [2018-01-25 00:07:35,566 INFO L226 Difference]: Without dead ends: 215 [2018-01-25 00:07:35,567 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 00:07:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-25 00:07:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 170. [2018-01-25 00:07:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-25 00:07:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-01-25 00:07:35,582 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 18 [2018-01-25 00:07:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:35,582 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-01-25 00:07:35,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:07:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-01-25 00:07:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:07:35,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:35,583 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:07:35,584 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-01-25 00:07:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 743711378, now seen corresponding path program 1 times [2018-01-25 00:07:35,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:35,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:35,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:35,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:35,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:35,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:35,667 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 00:07:35,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:07:35,667 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:07:35,668 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 00:07:35,670 INFO L201 CegarAbsIntRunner]: [56], [61], [63], [66], [115], [122], [128], [129], [130], [131], [204], [214], [215], [216], [217], [236], [237], [238] [2018-01-25 00:07:35,714 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:07:35,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:07:35,838 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:07:35,840 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-01-25 00:07:35,859 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:07:35,924 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 87.5% of their original sizes. [2018-01-25 00:07:35,924 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:07:35,958 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:07:35,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:07:35,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-25 00:07:35,959 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:35,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:07:35,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:07:35,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:07:35,960 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 6 states. [2018-01-25 00:07:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:07:40,317 INFO L93 Difference]: Finished difference Result 343 states and 369 transitions. [2018-01-25 00:07:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:07:40,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 00:07:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:07:40,357 INFO L225 Difference]: With dead ends: 343 [2018-01-25 00:07:40,358 INFO L226 Difference]: Without dead ends: 178 [2018-01-25 00:07:40,359 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 16 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 00:07:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-25 00:07:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-01-25 00:07:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-25 00:07:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-01-25 00:07:40,377 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 21 [2018-01-25 00:07:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:07:40,378 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-01-25 00:07:40,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:07:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-01-25 00:07:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:07:40,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:07:40,379 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] [2018-01-25 00:07:40,379 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-01-25 00:07:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash 667479760, now seen corresponding path program 1 times [2018-01-25 00:07:40,380 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:07:40,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:40,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:07:40,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:07:40,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:07:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:07:40,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:07:40,460 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 00:07:40,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:07:40,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:07:40,461 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 00:07:40,461 INFO L201 CegarAbsIntRunner]: [56], [61], [63], [66], [115], [122], [125], [126], [127], [128], [129], [130], [131], [204], [214], [215], [216], [217], [236], [237], [238] [2018-01-25 00:07:40,462 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:07:40,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:07:41,730 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:07:41,730 INFO L268 AbstractInterpreter]: Visited 21 different actions 35 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-01-25 00:07:41,745 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:07:42,491 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 77.45% of their original sizes. [2018-01-25 00:07:42,491 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:07:42,609 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:07:42,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:07:42,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-01-25 00:07:42,610 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:07:42,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 00:07:42,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 00:07:42,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:07:42,611 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 12 states. Received shutdown request... [2018-01-25 00:08:38,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 00:08:38,596 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:08:38,603 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:08:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:08:38 BoogieIcfgContainer [2018-01-25 00:08:38,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:08:38,605 INFO L168 Benchmark]: Toolchain (without parser) took 64925.65 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 264.2 MB in the beginning and 1.2 GB in the end (delta: -901.7 MB). Peak memory consumption was 823.8 MB. Max. memory is 5.3 GB. [2018-01-25 00:08:38,606 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:08:38,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.66 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 248.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-01-25 00:08:38,606 INFO L168 Benchmark]: Boogie Preprocessor took 42.17 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:08:38,607 INFO L168 Benchmark]: RCFGBuilder took 568.92 ms. Allocated memory is still 305.1 MB. Free memory was 246.3 MB in the beginning and 205.3 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. [2018-01-25 00:08:38,607 INFO L168 Benchmark]: TraceAbstraction took 64063.02 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 205.3 MB in the beginning and 1.2 GB in the end (delta: -960.5 MB). Peak memory consumption was 764.9 MB. Max. memory is 5.3 GB. [2018-01-25 00:08:38,609 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.66 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 248.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.17 ms. Allocated memory is still 305.1 MB. Free memory was 248.2 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 568.92 ms. Allocated memory is still 305.1 MB. Free memory was 246.3 MB in the beginning and 205.3 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64063.02 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 205.3 MB in the beginning and 1.2 GB in the end (delta: -960.5 MB). Peak memory consumption was 764.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 12 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 57 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -24 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 21 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 24 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.520648 RENAME_VARIABLES(MILLISECONDS) : 0.093733 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.161417 PROJECTAWAY(MILLISECONDS) : 0.019039 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.158659 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.118846 ADD_EQUALITY(MILLISECONDS) : 0.025737 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010503 #CONJOIN_DISJUNCTIVE : 20 #RENAME_VARIABLES : 41 #UNFREEZE : 0 #CONJOIN : 42 #PROJECTAWAY : 42 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 40 #ADD_EQUALITY : 24 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 92 LocStat_NO_SUPPORTING_DISEQUALITIES : 26 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.211823 RENAME_VARIABLES(MILLISECONDS) : 0.070732 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.174271 PROJECTAWAY(MILLISECONDS) : 0.048971 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.080086 DISJOIN(MILLISECONDS) : 0.621088 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.093828 ADD_EQUALITY(MILLISECONDS) : 0.016391 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.031279 #CONJOIN_DISJUNCTIVE : 61 #RENAME_VARIABLES : 120 #UNFREEZE : 0 #CONJOIN : 110 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 117 #ADD_EQUALITY : 43 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 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 (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (176states) and interpolant automaton (currently 18 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 173 locations, 45 error locations. TIMEOUT Result, 63.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 60.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 600 SDtfs, 240 SDslu, 1765 SDs, 0 SdLazy, 159 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.8967687074829931 AbsIntWeakeningRatio, 0.9047619047619048 AbsIntAvgWeakeningVarsNumRemoved, 2.619047619047619 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 97 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 2859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 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_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-08-38-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-08-38-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-08-38-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_00-08-38-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_00-08-38-624.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-08-38-624.csv Completed graceful shutdown