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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:43:44,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:43:44,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:43:44,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:43:44,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:43:44,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:43:44,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:43:44,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:43:44,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:43:44,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:43:44,647 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:43:44,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:43:44,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:43:44,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:43:44,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:43:44,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:43:44,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:43:44,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:43:44,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:43:44,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:43:44,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:43:44,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:43:44,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:43:44,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:43:44,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:43:44,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:43:44,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:43:44,666 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:43:44,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:43:44,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:43:44,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:43:44,667 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_mostprecise.epf [2018-01-24 20:43:44,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:43:44,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:43:44,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:43:44,678 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:43:44,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:43:44,679 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:43:44,679 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:43:44,679 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:43:44,679 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:43:44,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:43:44,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:43:44,680 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:43:44,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:43:44,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:43:44,682 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:43:44,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:43:44,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:43:44,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:43:44,682 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:43:44,682 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:43:44,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:43:44,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:43:44,683 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:43:44,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:43:44,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:43:44,683 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:43:44,684 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:43:44,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:43:44,684 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:43:44,684 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:43:44,685 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:43:44,685 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:43:44,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:43:44,731 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:43:44,735 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:43:44,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:43:44,737 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:43:44,738 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-24 20:43:44,946 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:43:44,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:43:44,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:43:44,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:43:44,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:43:44,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:43:44" (1/1) ... [2018-01-24 20:43:44,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388a8c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:44, skipping insertion in model container [2018-01-24 20:43:44,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:43:44" (1/1) ... [2018-01-24 20:43:44,985 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:43:45,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:43:45,167 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:43:45,197 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:43:45,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45 WrapperNode [2018-01-24 20:43:45,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:43:45,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:43:45,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:43:45,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:43:45,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (1/1) ... [2018-01-24 20:43:45,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:43:45,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:43:45,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:43:45,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:43:45,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (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-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-24 20:43:45,323 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-24 20:43:45,324 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:43:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:43:45,325 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:43:45,325 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:43:45,325 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:43:45,325 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:43:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:43:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:43:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:43:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-24 20:43:45,326 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-24 20:43:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:43:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-01-24 20:43:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:43:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:43:45,995 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:43:45,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:43:45 BoogieIcfgContainer [2018-01-24 20:43:45,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:43:45,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:43:45,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:43:45,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:43:46,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:43:44" (1/3) ... [2018-01-24 20:43:46,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f766fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:43:46, skipping insertion in model container [2018-01-24 20:43:46,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:43:45" (2/3) ... [2018-01-24 20:43:46,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f766fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:43:46, skipping insertion in model container [2018-01-24 20:43:46,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:43:45" (3/3) ... [2018-01-24 20:43:46,003 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-24 20:43:46,011 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:43:46,020 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-24 20:43:46,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:43:46,083 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:43:46,084 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:43:46,084 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:43:46,084 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:43:46,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:43:46,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:43:46,084 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:43:46,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:43:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-01-24 20:43:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:43:46,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:43:46,129 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:43:46,130 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-24 20:43:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -26265707, now seen corresponding path program 1 times [2018-01-24 20:43:46,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:43:46,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:46,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:43:46,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:46,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:43:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:43:46,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:43:46,417 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-24 20:43:46,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:43:46,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:43:46,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:43:46,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:43:46,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:43:46,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:43:46,541 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2018-01-24 20:43:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:43:46,902 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2018-01-24 20:43:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:43:46,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 20:43:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:43:46,923 INFO L225 Difference]: With dead ends: 231 [2018-01-24 20:43:46,923 INFO L226 Difference]: Without dead ends: 224 [2018-01-24 20:43:46,927 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-24 20:43:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-24 20:43:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-01-24 20:43:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 20:43:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-01-24 20:43:46,985 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 16 [2018-01-24 20:43:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:43:46,985 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-01-24 20:43:46,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:43:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-01-24 20:43:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:43:46,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:43:46,987 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-24 20:43:46,987 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-24 20:43:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash -325108585, now seen corresponding path program 1 times [2018-01-24 20:43:46,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:43:46,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:46,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:43:46,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:46,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:43:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:43:47,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:43:47,095 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-24 20:43:47,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:43:47,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:43:47,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:43:47,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:43:47,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:43:47,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:43:47,099 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 6 states. [2018-01-24 20:43:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:43:47,188 INFO L93 Difference]: Finished difference Result 219 states and 244 transitions. [2018-01-24 20:43:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:43:47,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 20:43:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:43:47,192 INFO L225 Difference]: With dead ends: 219 [2018-01-24 20:43:47,192 INFO L226 Difference]: Without dead ends: 215 [2018-01-24 20:43:47,193 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-24 20:43:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-24 20:43:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 170. [2018-01-24 20:43:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-24 20:43:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-01-24 20:43:47,214 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 18 [2018-01-24 20:43:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:43:47,214 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-01-24 20:43:47,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:43:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-01-24 20:43:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:43:47,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:43:47,216 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-24 20:43:47,216 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-24 20:43:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 743711378, now seen corresponding path program 1 times [2018-01-24 20:43:47,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:43:47,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:47,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:43:47,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:47,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:43:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:43:47,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:43:47,337 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-24 20:43:47,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:43:47,338 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:43:47,339 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-24 20:43:47,344 INFO L201 CegarAbsIntRunner]: [56], [61], [63], [66], [115], [122], [128], [129], [130], [131], [204], [214], [215], [216], [217], [236], [237], [238] [2018-01-24 20:43:47,421 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:43:47,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:43:47,629 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:43:47,631 INFO L268 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-01-24 20:43:47,645 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:43:47,736 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 87.5% of their original sizes. [2018-01-24 20:43:47,737 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:43:47,777 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:43:47,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:43:47,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-24 20:43:47,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:43:47,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:43:47,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:43:47,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:43:47,779 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 6 states. [2018-01-24 20:43:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:43:52,554 INFO L93 Difference]: Finished difference Result 343 states and 369 transitions. [2018-01-24 20:43:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:43:52,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 20:43:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:43:52,556 INFO L225 Difference]: With dead ends: 343 [2018-01-24 20:43:52,556 INFO L226 Difference]: Without dead ends: 178 [2018-01-24 20:43:52,557 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-24 20:43:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-24 20:43:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-01-24 20:43:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 20:43:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-01-24 20:43:52,569 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 21 [2018-01-24 20:43:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:43:52,569 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-01-24 20:43:52,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:43:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-01-24 20:43:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:43:52,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:43:52,570 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-24 20:43:52,570 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-24 20:43:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash 667479760, now seen corresponding path program 1 times [2018-01-24 20:43:52,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:43:52,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:52,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:43:52,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:43:52,572 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:43:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:43:52,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:43:52,738 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-24 20:43:52,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:43:52,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:43:52,739 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 20:43:52,739 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-24 20:43:52,741 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:43:52,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:43:54,056 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:43:54,056 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-24 20:43:54,059 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:43:54,577 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 77.45% of their original sizes. [2018-01-24 20:43:54,577 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:43:54,665 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:43:54,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:43:54,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2018-01-24 20:43:54,666 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:43:54,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 20:43:54,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 20:43:54,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 20:43:54,667 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 12 states. Received shutdown request... [2018-01-24 20:44:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 20:44:46,167 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:44:46,172 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:44:46,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:44:46 BoogieIcfgContainer [2018-01-24 20:44:46,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:44:46,173 INFO L168 Benchmark]: Toolchain (without parser) took 61226.34 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 262.4 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 234.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:44:46,174 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:44:46,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.46 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 247.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:44:46,174 INFO L168 Benchmark]: Boogie Preprocessor took 52.93 ms. Allocated memory is still 305.1 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:44:46,174 INFO L168 Benchmark]: RCFGBuilder took 730.58 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 204.5 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:44:46,175 INFO L168 Benchmark]: TraceAbstraction took 60175.61 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 204.5 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 176.2 MB. Max. memory is 5.3 GB. [2018-01-24 20:44:46,176 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.22 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 257.46 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 247.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.93 ms. Allocated memory is still 305.1 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 730.58 ms. Allocated memory is still 305.1 MB. Free memory was 245.5 MB in the beginning and 204.5 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60175.61 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 204.5 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 176.2 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.806442 RENAME_VARIABLES(MILLISECONDS) : 0.134251 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.260758 PROJECTAWAY(MILLISECONDS) : 0.030293 ADD_WEAK_EQUALITY(MILLISECONDS) : 5.274339 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.174993 ADD_EQUALITY(MILLISECONDS) : 0.042636 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020715 #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.243326 RENAME_VARIABLES(MILLISECONDS) : 0.076564 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.198777 PROJECTAWAY(MILLISECONDS) : 0.062451 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.047317 DISJOIN(MILLISECONDS) : 0.611086 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.105673 ADD_EQUALITY(MILLISECONDS) : 0.013530 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039741 #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, 60.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 56.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, 55.4s 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.6s 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.4s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-44-46-188.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-44-46-188.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-44-46-188.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-44-46-188.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-44-46-188.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-44-46-188.csv Completed graceful shutdown