java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:38:24,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:38:24,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:38:24,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:38:24,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:38:24,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:38:24,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:38:24,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:38:24,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:38:24,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:38:24,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:38:24,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:38:24,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:38:24,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:38:24,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:38:24,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:38:24,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:38:24,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:38:24,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:38:24,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:38:24,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:38:24,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:38:24,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:38:24,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:38:24,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:38:24,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:38:24,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:38:24,700 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:38:24,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:38:24,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:38:24,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:38:24,701 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 16:38:24,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:38:24,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:38:24,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:38:24,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:38:24,714 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:38:24,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:38:24,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:38:24,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:38:24,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:38:24,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:38:24,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:38:24,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:38:24,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:38:24,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:38:24,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:38:24,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:38:24,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:38:24,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:38:24,766 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:38:24,769 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:38:24,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:38:24,770 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:38:24,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i [2018-02-04 16:38:24,902 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:38:24,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:38:24,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:38:24,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:38:24,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:38:24,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:38:24" (1/1) ... [2018-02-04 16:38:24,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:24, skipping insertion in model container [2018-02-04 16:38:24,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:38:24" (1/1) ... [2018-02-04 16:38:24,923 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:38:24,955 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:38:25,034 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:38:25,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:38:25,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25 WrapperNode [2018-02-04 16:38:25,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:38:25,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:38:25,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:38:25,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:38:25,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... [2018-02-04 16:38:25,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:38:25,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:38:25,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:38:25,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:38:25,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:38:25,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:38:25,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:38:25,106 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:38:25,106 INFO L136 BoogieDeclarations]: Found implementation of procedure h_safe [2018-02-04 16:38:25,106 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:38:25,107 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:38:25,107 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure h_safe [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:38:25,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:38:25,219 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:38:25,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:38:25 BoogieIcfgContainer [2018-02-04 16:38:25,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:38:25,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:38:25,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:38:25,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:38:25,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:38:24" (1/3) ... [2018-02-04 16:38:25,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e495857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:38:25, skipping insertion in model container [2018-02-04 16:38:25,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:38:25" (2/3) ... [2018-02-04 16:38:25,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e495857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:38:25, skipping insertion in model container [2018-02-04 16:38:25,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:38:25" (3/3) ... [2018-02-04 16:38:25,227 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test3_true-valid-memsafety_true-termination.i [2018-02-04 16:38:25,233 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:38:25,237 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 16:38:25,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:38:25,268 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:38:25,268 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:38:25,268 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:38:25,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:38:25,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:38:25,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:38:25,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:38:25,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:38:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 16:38:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 16:38:25,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:25,286 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:25,286 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -36513995, now seen corresponding path program 1 times [2018-02-04 16:38:25,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:25,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:25,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:38:25,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,470 INFO L182 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(= 0 |ldv_malloc_#res.offset|), 35#(= 0 |h_safe_#t~ret2.offset|), 36#(= 0 |h_safe_#res.offset|), 37#(= 0 |entry_point_#t~ret3.offset|), 38#(= 0 entry_point_~p~0.offset)] [2018-02-04 16:38:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:38:25,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:38:25,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:25,481 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-02-04 16:38:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:25,542 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-02-04 16:38:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:38:25,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 16:38:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:25,550 INFO L225 Difference]: With dead ends: 38 [2018-02-04 16:38:25,590 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 16:38:25,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 16:38:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-04 16:38:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 16:38:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-04 16:38:25,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2018-02-04 16:38:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:25,614 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-04 16:38:25,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:38:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-04 16:38:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 16:38:25,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:25,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:25,615 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -36513994, now seen corresponding path program 1 times [2018-02-04 16:38:25,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:25,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:25,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:38:25,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,670 INFO L182 omatonBuilderFactory]: Interpolants [112#false, 113#(= 0 |ldv_malloc_#res.base|), 114#(= 0 |h_safe_#t~ret2.base|), 115#(= 0 |h_safe_#res.base|), 116#(= 0 |entry_point_#t~ret3.base|), 117#(= 0 entry_point_~p~0.base), 111#true] [2018-02-04 16:38:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:38:25,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:38:25,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:25,671 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2018-02-04 16:38:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:25,698 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 16:38:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:38:25,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 16:38:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:25,701 INFO L225 Difference]: With dead ends: 36 [2018-02-04 16:38:25,701 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 16:38:25,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 16:38:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-02-04 16:38:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 16:38:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 16:38:25,706 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-04 16:38:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:25,706 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 16:38:25,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:38:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 16:38:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 16:38:25,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:25,707 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:25,707 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash 133826739, now seen corresponding path program 1 times [2018-02-04 16:38:25,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:25,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:25,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:38:25,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,792 INFO L182 omatonBuilderFactory]: Interpolants [192#(= 0 |h_safe_#t~ret2.offset|), 193#(= 0 |h_safe_#res.offset|), 194#(= 0 |entry_point_#t~ret3.offset|), 195#(= 0 entry_point_~p~0.offset), 188#true, 189#false, 190#(= 0 |ldv_malloc_#t~malloc1.offset|), 191#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 16:38:25,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-02-04 16:38:25,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:38:25,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:38:25,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:38:25,793 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-04 16:38:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:25,846 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-04 16:38:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:38:25,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 16:38:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:25,847 INFO L225 Difference]: With dead ends: 33 [2018-02-04 16:38:25,847 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 16:38:25,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:38:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 16:38:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-04 16:38:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 16:38:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-04 16:38:25,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2018-02-04 16:38:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:25,852 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-04 16:38:25,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:38:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-04 16:38:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 16:38:25,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:25,853 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:25,853 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash 133826740, now seen corresponding path program 1 times [2018-02-04 16:38:25,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:25,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:25,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:38:25,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,925 INFO L182 omatonBuilderFactory]: Interpolants [264#true, 265#false, 266#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 267#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 268#(= 1 (select |#valid| |h_safe_#t~ret2.base|)), 269#(= 1 (select |#valid| |h_safe_#res.base|)), 270#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 271#(= 1 (select |#valid| entry_point_~p~0.base))] [2018-02-04 16:38:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:25,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:38:25,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:38:25,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:38:25,926 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2018-02-04 16:38:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:25,999 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 16:38:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:38:26,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 16:38:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:26,000 INFO L225 Difference]: With dead ends: 34 [2018-02-04 16:38:26,001 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 16:38:26,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:38:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 16:38:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-02-04 16:38:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 16:38:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 16:38:26,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-02-04 16:38:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:26,004 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 16:38:26,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:38:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 16:38:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 16:38:26,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:26,005 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:26,005 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -730055936, now seen corresponding path program 1 times [2018-02-04 16:38:26,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:26,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:26,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:38:26,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,041 INFO L182 omatonBuilderFactory]: Interpolants [332#true, 333#false, 334#(= |#valid| |old(#valid)|)] [2018-02-04 16:38:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:38:26,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:38:26,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:38:26,041 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-02-04 16:38:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:26,054 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-02-04 16:38:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:38:26,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-04 16:38:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:26,056 INFO L225 Difference]: With dead ends: 35 [2018-02-04 16:38:26,056 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 16:38:26,056 INFO L554 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-02-04 16:38:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 16:38:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-04 16:38:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 16:38:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 16:38:26,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2018-02-04 16:38:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:26,059 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 16:38:26,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:38:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 16:38:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:38:26,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:26,060 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:26,060 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1161698987, now seen corresponding path program 1 times [2018-02-04 16:38:26,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:26,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:26,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:38:26,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,121 INFO L182 omatonBuilderFactory]: Interpolants [401#true, 402#false, 403#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 404#(and (= 0 |h_safe_#t~ret2.offset|) (= 0 |h_safe_#t~ret2.base|)), 405#(and (= 0 |h_safe_#res.offset|) (= 0 |h_safe_#res.base|)), 406#(and (= 0 |entry_point_#t~ret3.offset|) (= 0 |entry_point_#t~ret3.base|)), 407#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-04 16:38:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:38:26,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:38:26,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:26,122 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 7 states. [2018-02-04 16:38:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:26,132 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 16:38:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:38:26,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 16:38:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:26,133 INFO L225 Difference]: With dead ends: 33 [2018-02-04 16:38:26,133 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 16:38:26,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:38:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 16:38:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-02-04 16:38:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 16:38:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-04 16:38:26,135 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-02-04 16:38:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:26,135 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-04 16:38:26,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:38:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-04 16:38:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 16:38:26,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:26,136 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:26,136 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -241367810, now seen corresponding path program 1 times [2018-02-04 16:38:26,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:26,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:26,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 16:38:26,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,187 INFO L182 omatonBuilderFactory]: Interpolants [465#true, 466#false, 467#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 468#(not (= 0 |ldv_malloc_#res.base|)), 469#(not (= 0 |h_safe_#t~ret2.base|)), 470#(not (= 0 |h_safe_#res.base|)), 471#(not (= 0 |entry_point_#t~ret3.base|)), 472#(not (= 0 entry_point_~p~0.base))] [2018-02-04 16:38:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:38:26,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:38:26,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:38:26,188 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-02-04 16:38:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:26,221 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-02-04 16:38:26,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:38:26,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 16:38:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:26,224 INFO L225 Difference]: With dead ends: 24 [2018-02-04 16:38:26,224 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 16:38:26,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:38:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 16:38:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 16:38:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 16:38:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-02-04 16:38:26,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2018-02-04 16:38:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:26,227 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-02-04 16:38:26,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:38:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-02-04 16:38:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:38:26,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:38:26,228 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:38:26,228 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:38:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1102731031, now seen corresponding path program 1 times [2018-02-04 16:38:26,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:38:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:38:26,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:38:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:38:26,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 16:38:26,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:38:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,385 INFO L182 omatonBuilderFactory]: Interpolants [528#(and (= (select |old(#valid)| |h_safe_#t~ret2.base|) 0) (not (= 0 |h_safe_#t~ret2.base|)) (= |#valid| (store |old(#valid)| |h_safe_#t~ret2.base| (select |#valid| |h_safe_#t~ret2.base|)))), 529#(and (= (select |old(#valid)| |h_safe_#res.base|) 0) (not (= 0 |h_safe_#res.base|)) (= (store |old(#valid)| |h_safe_#res.base| (select |#valid| |h_safe_#res.base|)) |#valid|)), 530#(and (not (= 0 |entry_point_#t~ret3.base|)) (= (select |old(#valid)| |entry_point_#t~ret3.base|) 0) (= |#valid| (store |old(#valid)| |entry_point_#t~ret3.base| (select |#valid| |entry_point_#t~ret3.base|)))), 531#(and (= (store |old(#valid)| entry_point_~p~0.base (select (store |#valid| entry_point_~p~0.base 0) entry_point_~p~0.base)) (store |#valid| entry_point_~p~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) (select (store |#valid| entry_point_~p~0.base 0) entry_point_~p~0.base))), 523#true, 524#false, 525#(= |#valid| |old(#valid)|), 526#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 527#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|)))] [2018-02-04 16:38:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:38:26,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:38:26,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:38:26,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:38:26,386 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 9 states. [2018-02-04 16:38:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:38:26,479 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-02-04 16:38:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:38:26,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 16:38:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:38:26,481 INFO L225 Difference]: With dead ends: 23 [2018-02-04 16:38:26,481 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 16:38:26,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:38:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 16:38:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 16:38:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 16:38:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 16:38:26,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-02-04 16:38:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:38:26,482 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 16:38:26,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:38:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 16:38:26,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 16:38:26,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:38:26 BoogieIcfgContainer [2018-02-04 16:38:26,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:38:26,486 INFO L168 Benchmark]: Toolchain (without parser) took 1583.66 ms. Allocated memory was 410.5 MB in the beginning and 622.9 MB in the end (delta: 212.3 MB). Free memory was 367.2 MB in the beginning and 451.9 MB in the end (delta: -84.7 MB). Peak memory consumption was 127.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:38:26,487 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 410.5 MB. Free memory is still 373.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:38:26,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.71 ms. Allocated memory is still 410.5 MB. Free memory was 367.2 MB in the beginning and 355.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 16:38:26,487 INFO L168 Benchmark]: Boogie Preprocessor took 19.48 ms. Allocated memory is still 410.5 MB. Free memory was 355.3 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:38:26,487 INFO L168 Benchmark]: RCFGBuilder took 150.90 ms. Allocated memory is still 410.5 MB. Free memory was 352.7 MB in the beginning and 338.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:38:26,488 INFO L168 Benchmark]: TraceAbstraction took 1265.41 ms. Allocated memory was 410.5 MB in the beginning and 622.9 MB in the end (delta: 212.3 MB). Free memory was 338.0 MB in the beginning and 451.9 MB in the end (delta: -113.9 MB). Peak memory consumption was 98.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:38:26,489 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.18 ms. Allocated memory is still 410.5 MB. Free memory is still 373.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.71 ms. Allocated memory is still 410.5 MB. Free memory was 367.2 MB in the beginning and 355.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.48 ms. Allocated memory is still 410.5 MB. Free memory was 355.3 MB in the beginning and 352.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 150.90 ms. Allocated memory is still 410.5 MB. Free memory was 352.7 MB in the beginning and 338.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1265.41 ms. Allocated memory was 410.5 MB in the beginning and 622.9 MB in the end (delta: 212.3 MB). Free memory was 338.0 MB in the beginning and 451.9 MB in the end (delta: -113.9 MB). Peak memory consumption was 98.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 3 error locations. SAFE Result, 1.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 28 SDslu, 739 SDs, 0 SdLazy, 334 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 10716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-38-26-496.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-38-26-496.csv Received shutdown request...