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_test5_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:24:40,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:24:40,699 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:24:40,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:24:40,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:24:40,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:24:40,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:24:40,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:24:40,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:24:40,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:24:40,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:24:40,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:24:40,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:24:40,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:24:40,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:24:40,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:24:40,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:24:40,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:24:40,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:24:40,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:24:40,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:24:40,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:24:40,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:24:40,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:24:40,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:24:40,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:24:40,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:24:40,729 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:24:40,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:24:40,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:24:40,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:24:40,730 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 03:24:40,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:24:40,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:24:40,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:24:40,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:24:40,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:24:40,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:24:40,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:24:40,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:24:40,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:24:40,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:24:40,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:24:40,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:24:40,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:24:40,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:24:40,784 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:24:40,787 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:24:40,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:24:40,789 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:24:40,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-04 03:24:40,933 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:24:40,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:24:40,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:40,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:24:40,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:24:40,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce31117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40, skipping insertion in model container [2018-02-04 03:24:40,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,959 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:40,996 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:41,077 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:41,086 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:41,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41 WrapperNode [2018-02-04 03:24:41,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:41,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:24:41,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:24:41,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:24:41,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (1/1) ... [2018-02-04 03:24:41,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:24:41,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:24:41,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:24:41,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:24:41,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (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 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure h5 [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:24:41,154 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure h5 [2018-02-04 03:24:41,155 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-02-04 03:24:41,156 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:24:41,156 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:24:41,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:24:41,156 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:24:41,260 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:24:41,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:41 BoogieIcfgContainer [2018-02-04 03:24:41,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:24:41,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:24:41,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:24:41,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:24:41,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:24:40" (1/3) ... [2018-02-04 03:24:41,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6755ab2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:41, skipping insertion in model container [2018-02-04 03:24:41,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:41" (2/3) ... [2018-02-04 03:24:41,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6755ab2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:41, skipping insertion in model container [2018-02-04 03:24:41,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:41" (3/3) ... [2018-02-04 03:24:41,265 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-04 03:24:41,271 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:24:41,275 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 03:24:41,305 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:24:41,305 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:24:41,305 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:24:41,305 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:24:41,305 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:24:41,306 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:24:41,306 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:24:41,306 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:24:41,307 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:24:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-02-04 03:24:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:24:41,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,327 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 03:24:41,327 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818119, now seen corresponding path program 1 times [2018-02-04 03:24:41,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,579 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 03:24:41,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:24:41,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,583 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 03:24:41,583 INFO L182 omatonBuilderFactory]: Interpolants [36#true, 37#false, 38#(= 0 |ldv_malloc_#res.offset|), 39#(= 0 |h5_#t~ret2.offset|), 40#(= 0 |h5_#res.offset|), 41#(= 0 |entry_point_#t~ret3.offset|), 42#(= 0 entry_point_~p~1.offset), 43#(= 0 |g5_#in~p.offset|), 44#(= 0 g5_~p.offset)] [2018-02-04 03:24:41,584 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 03:24:41,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:24:41,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:24:41,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:41,601 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 9 states. [2018-02-04 03:24:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,740 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 03:24:41,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:41,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 03:24:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,751 INFO L225 Difference]: With dead ends: 48 [2018-02-04 03:24:41,752 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 03:24:41,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 03:24:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-04 03:24:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 03:24:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 03:24:41,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-02-04 03:24:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,787 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 03:24:41,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:24:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 03:24:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:24:41,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,788 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 03:24:41,788 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818118, now seen corresponding path program 1 times [2018-02-04 03:24:41,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,877 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 03:24:41,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:24:41,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,877 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 03:24:41,877 INFO L182 omatonBuilderFactory]: Interpolants [144#(= 0 |g5_#in~p.base|), 145#(= g5_~p.base 0), 137#true, 138#false, 139#(= 0 |ldv_malloc_#res.base|), 140#(= 0 |h5_#t~ret2.base|), 141#(= 0 |h5_#res.base|), 142#(= 0 |entry_point_#t~ret3.base|), 143#(= 0 entry_point_~p~1.base)] [2018-02-04 03:24:41,877 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 03:24:41,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:24:41,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:24:41,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:24:41,879 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-02-04 03:24:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,916 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-04 03:24:41,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:41,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 03:24:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,917 INFO L225 Difference]: With dead ends: 46 [2018-02-04 03:24:41,917 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 03:24:41,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 03:24:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-04 03:24:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 03:24:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 03:24:41,922 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2018-02-04 03:24:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,922 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 03:24:41,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:24:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 03:24:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:24:41,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,923 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 03:24:41,923 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905065, now seen corresponding path program 1 times [2018-02-04 03:24:41,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,013 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 03:24:42,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:24:42,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,014 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 03:24:42,014 INFO L182 omatonBuilderFactory]: Interpolants [240#(= 0 |h5_#t~ret2.offset|), 241#(= 0 |h5_#res.offset|), 242#(= 0 |entry_point_#t~ret3.offset|), 243#(= 0 entry_point_~p~1.offset), 244#(= 0 |g5_#in~p.offset|), 245#(= 0 g5_~p.offset), 236#true, 237#false, 238#(= 0 |ldv_malloc_#t~malloc1.offset|), 239#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 03:24:42,014 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 03:24:42,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,015 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-02-04 03:24:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,076 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 03:24:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:24:42,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 03:24:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,077 INFO L225 Difference]: With dead ends: 41 [2018-02-04 03:24:42,077 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 03:24:42,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 03:24:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 03:24:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 03:24:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-04 03:24:42,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2018-02-04 03:24:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,083 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-04 03:24:42,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-04 03:24:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:24:42,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,084 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 03:24:42,084 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905064, now seen corresponding path program 1 times [2018-02-04 03:24:42,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,168 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 03:24:42,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:24:42,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,169 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 03:24:42,169 INFO L182 omatonBuilderFactory]: Interpolants [336#(= 1 (select |#valid| |h5_#t~ret2.base|)), 337#(= 1 (select |#valid| |h5_#res.base|)), 338#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 339#(= 1 (select |#valid| entry_point_~p~1.base)), 340#(= 1 (select |#valid| |g5_#in~p.base|)), 341#(= 1 (select |#valid| g5_~p.base)), 332#true, 333#false, 334#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 335#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-04 03:24:42,170 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 03:24:42,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,171 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-02-04 03:24:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,261 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-02-04 03:24:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:42,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 03:24:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,262 INFO L225 Difference]: With dead ends: 44 [2018-02-04 03:24:42,262 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 03:24:42,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 03:24:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-02-04 03:24:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 03:24:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 03:24:42,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-02-04 03:24:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,265 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 03:24:42,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 03:24:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:24:42,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,266 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, 1] [2018-02-04 03:24:42,266 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1043029204, now seen corresponding path program 1 times [2018-02-04 03:24:42,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,288 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 03:24:42,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:24:42,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,289 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 03:24:42,289 INFO L182 omatonBuilderFactory]: Interpolants [418#true, 419#false, 420#(= |#valid| |old(#valid)|)] [2018-02-04 03:24:42,289 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 03:24:42,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:24:42,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:24:42,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:24:42,290 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-02-04 03:24:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,336 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-04 03:24:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:24:42,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-04 03:24:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,338 INFO L225 Difference]: With dead ends: 40 [2018-02-04 03:24:42,338 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 03:24:42,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 03:24:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 03:24:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 03:24:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 03:24:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 03:24:42,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-02-04 03:24:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,349 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 03:24:42,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:24:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 03:24:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:24:42,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,351 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, 1, 1] [2018-02-04 03:24:42,351 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1685081515, now seen corresponding path program 1 times [2018-02-04 03:24:42,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,459 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 03:24:42,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:24:42,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,460 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 03:24:42,460 INFO L182 omatonBuilderFactory]: Interpolants [498#true, 499#false, 500#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 501#(and (= 0 |h5_#t~ret2.offset|) (= 0 |h5_#t~ret2.base|)), 502#(and (= 0 |h5_#res.offset|) (= 0 |h5_#res.base|)), 503#(and (= 0 |entry_point_#t~ret3.offset|) (= 0 |entry_point_#t~ret3.base|)), 504#(and (= 0 entry_point_~p~1.base) (= 0 entry_point_~p~1.offset)), 505#(and (= g5_~p.offset |g5_#in~p.offset|) (= g5_~p.base |g5_#in~p.base|)), 506#(and (or (not (= g5_~p.base 0)) (and (not (= 0 g5_~p.offset)) (= g5_~p.offset |g5_#in~p.offset|))) (or (= g5_~p.base 0) (= |g5_#in~p.base| g5_~p.base))), 507#(or (not (= 0 |g5_#in~p.offset|)) (not (= |g5_#in~p.base| 0)))] [2018-02-04 03:24:42,460 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 03:24:42,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,461 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-04 03:24:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,516 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-02-04 03:24:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:24:42,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-04 03:24:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,517 INFO L225 Difference]: With dead ends: 37 [2018-02-04 03:24:42,518 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 03:24:42,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:24:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 03:24:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-02-04 03:24:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 03:24:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-04 03:24:42,521 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-02-04 03:24:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,521 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-04 03:24:42,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-04 03:24:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:24:42,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,522 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, 1, 1, 1] [2018-02-04 03:24:42,522 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1527636810, now seen corresponding path program 1 times [2018-02-04 03:24:42,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,592 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 03:24:42,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:24:42,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,593 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 03:24:42,593 INFO L182 omatonBuilderFactory]: Interpolants [576#false, 577#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 578#(not (= 0 |ldv_malloc_#res.base|)), 579#(not (= 0 |h5_#t~ret2.base|)), 580#(not (= 0 |h5_#res.base|)), 581#(not (= 0 |entry_point_#t~ret3.base|)), 582#(not (= 0 entry_point_~p~1.base)), 583#(= |g5_#in~p.base| g5_~p.base), 584#(= 0 |g5_#in~p.base|), 575#true] [2018-02-04 03:24:42,593 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 03:24:42,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,594 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-02-04 03:24:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,667 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-04 03:24:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:42,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-04 03:24:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,668 INFO L225 Difference]: With dead ends: 30 [2018-02-04 03:24:42,668 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 03:24:42,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 03:24:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 03:24:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 03:24:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-02-04 03:24:42,671 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 26 [2018-02-04 03:24:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,671 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-02-04 03:24:42,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-02-04 03:24:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:24:42,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,672 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, 1, 1, 1, 1] [2018-02-04 03:24:42,672 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 03:24:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -228650675, now seen corresponding path program 1 times [2018-02-04 03:24:42,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,825 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 03:24:42,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:24:42,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,826 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 03:24:42,826 INFO L182 omatonBuilderFactory]: Interpolants [656#(and (= |#valid| |old(#valid)|) (= g5_~p.base |g5_#in~p.base|)), 657#(or (and (= 0 (select |#valid| |g5_#in~p.base|)) (= |old(#valid)| (store |#valid| |g5_#in~p.base| (select |old(#valid)| |g5_#in~p.base|)))) (= 0 |g5_#in~p.base|)), 647#true, 648#false, 649#(= |#valid| |old(#valid)|), 650#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 651#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 652#(and (= |old(#valid)| (store |#valid| |h5_#t~ret2.base| (select |old(#valid)| |h5_#t~ret2.base|))) (not (= 0 |h5_#t~ret2.base|)) (= 0 (select |old(#valid)| |h5_#t~ret2.base|))), 653#(and (not (= 0 |h5_#res.base|)) (= (store |#valid| |h5_#res.base| (select |old(#valid)| |h5_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |h5_#res.base|))), 654#(and (not (= 0 |entry_point_#t~ret3.base|)) (= 0 (select |old(#valid)| |entry_point_#t~ret3.base|)) (= (store |#valid| |entry_point_#t~ret3.base| (select |old(#valid)| |entry_point_#t~ret3.base|)) |old(#valid)|)), 655#(and (= (store |#valid| entry_point_~p~1.base (select |old(#valid)| entry_point_~p~1.base)) |old(#valid)|) (not (= 0 entry_point_~p~1.base)) (= 0 (select |old(#valid)| entry_point_~p~1.base)))] [2018-02-04 03:24:42,826 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 03:24:42,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:24:42,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:24:42,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:24:42,827 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 11 states. [2018-02-04 03:24:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,933 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-04 03:24:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:24:42,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 03:24:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,933 INFO L225 Difference]: With dead ends: 27 [2018-02-04 03:24:42,933 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:24:42,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:24:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:24:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:24:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:24:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:24:42,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 03:24:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,934 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:24:42,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:24:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:24:42,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:24:42,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:42 BoogieIcfgContainer [2018-02-04 03:24:42,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:42,939 INFO L168 Benchmark]: Toolchain (without parser) took 2005.23 ms. Allocated memory was 403.2 MB in the beginning and 626.0 MB in the end (delta: 222.8 MB). Free memory was 359.9 MB in the beginning and 533.4 MB in the end (delta: -173.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:42,940 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:42,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.50 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:42,940 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:42,940 INFO L168 Benchmark]: RCFGBuilder took 141.28 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 329.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:42,940 INFO L168 Benchmark]: TraceAbstraction took 1677.61 ms. Allocated memory was 403.2 MB in the beginning and 626.0 MB in the end (delta: 222.8 MB). Free memory was 329.5 MB in the beginning and 533.4 MB in the end (delta: -203.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:42,941 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.50 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 346.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.93 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 141.28 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 329.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1677.61 ms. Allocated memory was 403.2 MB in the beginning and 626.0 MB in the end (delta: 222.8 MB). Free memory was 329.5 MB in the beginning and 533.4 MB in the end (delta: -203.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1449]: 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 7 procedures, 33 locations, 3 error locations. SAFE Result, 1.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 65 SDslu, 1168 SDs, 0 SdLazy, 579 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 15048 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_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-42-947.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-42-947.csv Received shutdown request...