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/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:40:40,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:40:40,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:40:40,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:40:40,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:40:40,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:40:40,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:40:40,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:40:40,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:40:40,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:40:40,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:40:40,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:40:40,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:40:40,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:40:40,489 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:40:40,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:40:40,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:40:40,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:40:40,498 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:40:40,499 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:40:40,502 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:40:40,502 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:40:40,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:40:40,503 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:40:40,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:40:40,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:40:40,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:40:40,507 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:40:40,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:40:40,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:40:40,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:40:40,508 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:40:40,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:40:40,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:40:40,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:40:40,520 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:40:40,520 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:40:40,520 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:40:40,520 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:40:40,520 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:40:40,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:40:40,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:40:40,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:40:40,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:40:40,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:40:40,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:40:40,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:40:40,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:40:40,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:40:40,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:40:40,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:40:40,524 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:40:40,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:40:40,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:40:40,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:40:40,525 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:40:40,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:40:40,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:40:40,526 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:40:40,527 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:40:40,528 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:40:40,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:40:40,574 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:40:40,578 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:40:40,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:40:40,580 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:40:40,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-21 10:40:40,796 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:40:40,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:40:40,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:40:40,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:40:40,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:40:40,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:40:40" (1/1) ... [2018-01-21 10:40:40,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c7d0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:40, skipping insertion in model container [2018-01-21 10:40:40,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:40:40" (1/1) ... [2018-01-21 10:40:40,824 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:40:40,873 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:40:40,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:40:41,019 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:40:41,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41 WrapperNode [2018-01-21 10:40:41,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:40:41,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:40:41,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:40:41,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:40:41,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (1/1) ... [2018-01-21 10:40:41,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:40:41,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:40:41,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:40:41,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:40:41,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (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-21 10:40:41,117 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-21 10:40:41,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-21 10:40:41,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-21 10:40:41,119 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:40:41,119 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:40:41,119 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:40:41,119 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:40:41,119 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 10:40:41,120 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 10:40:41,120 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-21 10:40:41,121 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:40:41,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:40:41,356 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:40:41,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:40:41 BoogieIcfgContainer [2018-01-21 10:40:41,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:40:41,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:40:41,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:40:41,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:40:41,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:40:40" (1/3) ... [2018-01-21 10:40:41,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437cbfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:40:41, skipping insertion in model container [2018-01-21 10:40:41,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:41" (2/3) ... [2018-01-21 10:40:41,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437cbfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:40:41, skipping insertion in model container [2018-01-21 10:40:41,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:40:41" (3/3) ... [2018-01-21 10:40:41,364 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-21 10:40:41,370 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:40:41,377 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-01-21 10:40:41,417 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:41,418 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:41,418 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:41,418 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:41,418 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:41,418 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:41,418 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:41,418 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kref_initErr0EnsuresViolation======== [2018-01-21 10:40:41,419 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:40:41,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:41,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:41,446 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0EnsuresViolation]=== [2018-01-21 10:40:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1187502660, now seen corresponding path program 1 times [2018-01-21 10:40:41,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:41,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:41,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:41,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:41,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:41,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:41,744 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-21 10:40:41,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:41,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:40:41,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:41,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:40:41,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:40:41,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:41,838 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 10:40:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:41,901 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 10:40:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:41,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 10:40:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:41,909 INFO L225 Difference]: With dead ends: 114 [2018-01-21 10:40:41,910 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:41,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:41,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 10:40:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:41,936 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:41,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:40:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:41,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:41,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:40:41,995 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:41,996 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:41,996 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:41,997 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-21 10:40:41,997 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-21 10:40:41,997 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-21 10:40:41,997 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:41,997 INFO L404 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: true [2018-01-21 10:40:41,998 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-21 10:40:41,998 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-21 10:40:41,998 INFO L404 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: true [2018-01-21 10:40:41,998 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: true [2018-01-21 10:40:41,998 INFO L404 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: true [2018-01-21 10:40:41,998 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:41,998 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-21 10:40:41,998 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:41,999 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:42,000 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-21 10:40:42,000 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 10:40:42,001 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-21 10:40:42,001 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-21 10:40:42,001 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-21 10:40:42,001 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 10:40:42,001 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,001 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,002 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 10:40:42,002 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,002 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 10:40:42,002 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 10:40:42,002 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 10:40:42,002 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 10:40:42,002 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 10:40:42,003 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,003 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-21 10:40:42,003 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,003 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,003 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: true [2018-01-21 10:40:42,003 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,003 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,004 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: true [2018-01-21 10:40:42,005 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L404 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: true [2018-01-21 10:40:42,005 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-21 10:40:42,005 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-21 10:40:42,006 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,006 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-21 10:40:42,006 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,006 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,006 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-21 10:40:42,010 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,010 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,010 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,010 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,010 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,010 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,011 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,011 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_createErr0EnsuresViolation======== [2018-01-21 10:40:42,011 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 10:40:42,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,015 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,015 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_createErr0EnsuresViolation]=== [2018-01-21 10:40:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 219487307, now seen corresponding path program 1 times [2018-01-21 10:40:42,015 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,018 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,075 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-21 10:40:42,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:40:42,076 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:40:42,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:40:42,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:40:42,077 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 10:40:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,151 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 10:40:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:40:42,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 10:40:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,152 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:40:42,152 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:42,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 10:40:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:42,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 10:40:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,153 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:42,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:40:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:42,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:42,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:40:42,214 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initFINAL(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:42,214 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initEXIT(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point ldv_kref_initErr0EnsuresViolation(lines 1292 1295) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L404 ceAbstractionStarter]: At program point ldv_kref_initENTRY(lines 1292 1295) the Hoare annotation is: true [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point L1294(line 1294) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point L1411'(line 1411) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createErr0EnsuresViolation(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L397 ceAbstractionStarter]: At program point L1411(line 1411) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point L1408'(line 1408) no Hoare annotation was computed. [2018-01-21 10:40:42,215 INFO L401 ceAbstractionStarter]: For program point L1413'(line 1413) no Hoare annotation was computed. [2018-01-21 10:40:42,216 INFO L397 ceAbstractionStarter]: At program point L1408(line 1408) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,216 INFO L397 ceAbstractionStarter]: At program point ldv_kobject_createENTRY(lines 1404 1415) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,216 INFO L397 ceAbstractionStarter]: At program point L1413(line 1413) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,216 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createFINAL(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:42,216 INFO L401 ceAbstractionStarter]: For program point L1409(lines 1409 1410) no Hoare annotation was computed. [2018-01-21 10:40:42,216 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_createEXIT(lines 1404 1415) no Hoare annotation was computed. [2018-01-21 10:40:42,216 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:42,217 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_initENTRY(lines 1390 1403) the Hoare annotation is: true [2018-01-21 10:40:42,217 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initErr0EnsuresViolation(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 10:40:42,218 INFO L404 ceAbstractionStarter]: At program point L1398(line 1398) the Hoare annotation is: true [2018-01-21 10:40:42,218 INFO L404 ceAbstractionStarter]: At program point L1396(line 1396) the Hoare annotation is: true [2018-01-21 10:40:42,218 INFO L401 ceAbstractionStarter]: For program point L1394(lines 1394 1397) no Hoare annotation was computed. [2018-01-21 10:40:42,218 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_initEXIT(lines 1390 1403) no Hoare annotation was computed. [2018-01-21 10:40:42,218 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,218 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,218 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,218 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,219 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 10:40:42,219 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 10:40:42,219 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 10:40:42,219 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 10:40:42,219 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1443) the Hoare annotation is: true [2018-01-21 10:40:42,219 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,219 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1443) the Hoare annotation is: true [2018-01-21 10:40:42,219 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1441 1443) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1441 1443) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L404 ceAbstractionStarter]: At program point LDV_INIT_LIST_HEADENTRY(lines 1097 1101) the Hoare annotation is: true [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADFINAL(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point L1099'(line 1099) no Hoare annotation was computed. [2018-01-21 10:40:42,220 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADErr0EnsuresViolation(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point LDV_INIT_LIST_HEADEXIT(lines 1097 1101) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point L1099(line 1099) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1435 1439) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L397 ceAbstractionStarter]: At program point L1437(line 1437) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1435 1439) no Hoare annotation was computed. [2018-01-21 10:40:42,221 INFO L401 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-21 10:40:42,222 INFO L401 ceAbstractionStarter]: For program point L1380(lines 1380 1381) no Hoare annotation was computed. [2018-01-21 10:40:42,222 INFO L404 ceAbstractionStarter]: At program point L1382'(line 1382) the Hoare annotation is: true [2018-01-21 10:40:42,222 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalErr0EnsuresViolation(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,222 INFO L404 ceAbstractionStarter]: At program point ldv_kobject_init_internalENTRY(lines 1378 1388) the Hoare annotation is: true [2018-01-21 10:40:42,222 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalFINAL(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,222 INFO L401 ceAbstractionStarter]: For program point ldv_kobject_init_internalEXIT(lines 1378 1388) no Hoare annotation was computed. [2018-01-21 10:40:42,222 INFO L404 ceAbstractionStarter]: At program point L1382(line 1382) the Hoare annotation is: true [2018-01-21 10:40:42,224 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,225 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,225 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,225 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,225 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,225 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,225 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,225 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:40:42,226 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 10:40:42,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,228 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,228 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:40:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 517058824, now seen corresponding path program 1 times [2018-01-21 10:40:42,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,265 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-21 10:40:42,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:40:42,266 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:40:42,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:40:42,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:40:42,267 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 10:40:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,358 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 10:40:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:40:42,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 10:40:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,360 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:40:42,360 INFO L226 Difference]: Without dead ends: 16 [2018-01-21 10:40:42,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:40:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-21 10:40:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-21 10:40:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-21 10:40:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-21 10:40:42,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-21 10:40:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,369 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-21 10:40:42,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:40:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-21 10:40:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 10:40:42,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,369 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,370 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:40:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1322768470, now seen corresponding path program 1 times [2018-01-21 10:40:42,370 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,423 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:40:42,430 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,432 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,440 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,440 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,440 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,440 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,440 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,440 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,440 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,440 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_initErr0EnsuresViolation======== [2018-01-21 10:40:42,440 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 10:40:42,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,442 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,442 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_initErr0EnsuresViolation]=== [2018-01-21 10:40:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 102404402, now seen corresponding path program 1 times [2018-01-21 10:40:42,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,444 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,514 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-21 10:40:42,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:40:42,514 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:40:42,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:40:42,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:42,515 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 10:40:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,536 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 10:40:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:42,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 10:40:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,537 INFO L225 Difference]: With dead ends: 114 [2018-01-21 10:40:42,537 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:42,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:42,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 10:40:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,539 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:42,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:40:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:42,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:42,541 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,541 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,541 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,542 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,542 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:40:42,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:40:42,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:40:42,544 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:40:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash 110227, now seen corresponding path program 1 times [2018-01-21 10:40:42,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,553 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:40:42,554 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,556 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,556 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,557 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,557 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,557 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,557 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,557 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,557 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:40:42,557 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:40:42,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:40:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 225129469, now seen corresponding path program 1 times [2018-01-21 10:40:42,560 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:42,586 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:40:42,589 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,590 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,591 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,591 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,591 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,592 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:42,595 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,595 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,595 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,595 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,596 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,596 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,596 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:40:42,596 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 10:40:42,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:40:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash 585708474, now seen corresponding path program 1 times [2018-01-21 10:40:42,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,633 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-21 10:40:42,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:40:42,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:40:42,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:40:42,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:40:42,635 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 10:40:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,709 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 10:40:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:40:42,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-21 10:40:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,711 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:40:42,711 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:42,712 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 10:40:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:42,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-21 10:40:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,713 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:42,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:40:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:42,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:42,715 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,715 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,716 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,716 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,716 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,716 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,716 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,716 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == LDV_INIT_LIST_HEADErr0EnsuresViolation======== [2018-01-21 10:40:42,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 10:40:42,719 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,720 INFO L371 AbstractCegarLoop]: === Iteration 1 === [LDV_INIT_LIST_HEADErr0EnsuresViolation]=== [2018-01-21 10:40:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1993763615, now seen corresponding path program 1 times [2018-01-21 10:40:42,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,793 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-21 10:40:42,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:40:42,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:40:42,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:40:42,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:42,795 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 10:40:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,819 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 10:40:42,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:42,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 10:40:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,821 INFO L225 Difference]: With dead ends: 114 [2018-01-21 10:40:42,821 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:42,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:42,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-01-21 10:40:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,823 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:42,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:40:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:42,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:42,825 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,825 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,826 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,826 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,826 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,826 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,826 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,826 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:40:42,826 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:40:42,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,829 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,829 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:40:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1806194063, now seen corresponding path program 1 times [2018-01-21 10:40:42,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:42,870 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-21 10:40:42,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:42,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:40:42,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:42,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:40:42,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:40:42,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:40:42,871 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 10:40:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:42,963 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-21 10:40:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:40:42,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 10:40:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:42,965 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:40:42,965 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:42,965 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-21 10:40:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:42,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 10:40:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:42,966 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:42,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:40:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:42,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:42,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:42,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:42,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:42,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:42,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:42,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:42,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:42,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_kobject_init_internalErr0EnsuresViolation======== [2018-01-21 10:40:42,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 10:40:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:40:42,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:42,972 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:42,972 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kobject_init_internalErr0EnsuresViolation]=== [2018-01-21 10:40:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1305563254, now seen corresponding path program 1 times [2018-01-21 10:40:42,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:42,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:42,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:42,974 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:42,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:43,031 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-21 10:40:43,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:43,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:40:43,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:43,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:40:43,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:40:43,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:43,032 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-21 10:40:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:43,053 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2018-01-21 10:40:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:43,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 10:40:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:43,054 INFO L225 Difference]: With dead ends: 114 [2018-01-21 10:40:43,054 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:43,055 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:40:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:43,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-21 10:40:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:43,056 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:43,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:40:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:43,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:43,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:40:43 BoogieIcfgContainer [2018-01-21 10:40:43,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:40:43,060 INFO L168 Benchmark]: Toolchain (without parser) took 2263.85 ms. Allocated memory was 304.6 MB in the beginning and 474.5 MB in the end (delta: 169.9 MB). Free memory was 261.9 MB in the beginning and 431.1 MB in the end (delta: -169.2 MB). Peak memory consumption was 665.1 kB. Max. memory is 5.3 GB. [2018-01-21 10:40:43,062 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:40:43,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.81 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 248.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:43,062 INFO L168 Benchmark]: Boogie Preprocessor took 36.00 ms. Allocated memory is still 304.6 MB. Free memory was 248.6 MB in the beginning and 246.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:43,062 INFO L168 Benchmark]: RCFGBuilder took 291.25 ms. Allocated memory is still 304.6 MB. Free memory was 246.6 MB in the beginning and 227.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:43,063 INFO L168 Benchmark]: TraceAbstraction took 1701.33 ms. Allocated memory was 304.6 MB in the beginning and 474.5 MB in the end (delta: 169.9 MB). Free memory was 226.0 MB in the beginning and 431.1 MB in the end (delta: -205.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:40:43,065 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.24 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.81 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 248.6 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.00 ms. Allocated memory is still 304.6 MB. Free memory was 248.6 MB in the beginning and 246.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.25 ms. Allocated memory is still 304.6 MB. Free memory was 246.6 MB in the beginning and 227.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1701.33 ms. Allocated memory was 304.6 MB in the beginning and 474.5 MB in the end (delta: 169.9 MB). Free memory was 226.0 MB in the beginning and 431.1 MB in the end (delta: -205.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1292]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_kref_initErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 31 PreInvPairs, 33 NumberOfFragments, 21 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1404]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_kobject_createErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 28 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 21 NumberOfFragments, 39 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={18:0}, size=16] [L1074] return malloc(size); VAL [\old(size)=16, \result={18:0}, malloc(size)={18:0}, size=16] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1390]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_kobject_initErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=16, \result={0:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={0:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND TRUE !kobj [L1410] RET return 0; VAL [\result={0:0}, kobj={0:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={0:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1441]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 24 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1097]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: LDV_INIT_LIST_HEADErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 2257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1435]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 25 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1378]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_kobject_init_internalErr0EnsuresViolation CFG has 11 procedures, 65 locations, 10 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 4 SDslu, 184 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 1456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1396]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_10-40-43-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-21_10-40-43-079.csv Received shutdown request...