java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:55:46,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:55:46,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:55:46,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:55:46,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:55:46,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:55:46,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:55:46,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:55:46,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:55:46,106 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:55:46,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:55:46,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:55:46,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:55:46,110 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:55:46,111 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:55:46,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:55:46,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:55:46,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:55:46,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:55:46,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:55:46,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:55:46,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:55:46,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:55:46,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:55:46,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:55:46,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:55:46,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:55:46,128 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:55:46,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:55:46,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:55:46,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:55:46,130 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:55:46,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:55:46,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:55:46,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:55:46,140 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:55:46,140 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:55:46,140 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:55:46,140 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:55:46,140 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:55:46,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:55:46,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:55:46,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:55:46,141 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:55:46,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:55:46,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:55:46,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:55:46,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:55:46,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:55:46,143 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:55:46,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:55:46,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:55:46,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:55:46,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:55:46,145 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:55:46,145 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:55:46,145 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:55:46,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:55:46,194 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:55:46,198 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:55:46,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:55:46,199 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:55:46,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-21 00:55:46,387 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:55:46,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:55:46,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:46,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:55:46,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:55:46,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba505b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46, skipping insertion in model container [2018-01-21 00:55:46,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,414 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:46,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:46,583 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:46,601 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:46,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46 WrapperNode [2018-01-21 00:55:46,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:46,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:55:46,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:55:46,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:55:46,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... [2018-01-21 00:55:46,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:55:46,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:55:46,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:55:46,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:55:46,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:55:46,707 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:55:46,707 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:55:46,708 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:55:46,709 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:55:46,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:55:46,940 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:55:46,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:46 BoogieIcfgContainer [2018-01-21 00:55:46,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:55:46,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:55:46,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:55:46,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:55:46,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:55:46" (1/3) ... [2018-01-21 00:55:46,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb0250e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:46, skipping insertion in model container [2018-01-21 00:55:46,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:46" (2/3) ... [2018-01-21 00:55:46,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb0250e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:46, skipping insertion in model container [2018-01-21 00:55:46,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:46" (3/3) ... [2018-01-21 00:55:46,949 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-21 00:55:46,958 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:55:46,966 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 00:55:47,007 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:47,007 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:47,008 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:47,008 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:47,008 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:47,008 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:47,008 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:47,008 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:55:47,009 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:55:47,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,036 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,036 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:55:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2086039493, now seen corresponding path program 1 times [2018-01-21 00:55:47,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:47,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:47,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:47,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:47,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:47,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:47,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:47,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:47,224 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 00:55:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:47,467 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 00:55:47,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:47,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 00:55:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:47,477 INFO L225 Difference]: With dead ends: 102 [2018-01-21 00:55:47,478 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 00:55:47,482 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 00:55:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 00:55:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 00:55:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 00:55:47,521 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 00:55:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:47,522 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 00:55:47,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 00:55:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 00:55:47,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,524 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,524 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:55:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1065867417, now seen corresponding path program 1 times [2018-01-21 00:55:47,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,596 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:47,604 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,606 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,617 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:47,617 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:47,617 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:47,617 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:47,617 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:47,617 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:47,617 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:47,617 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:55:47,617 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:55:47,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:55:47,619 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:55:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 124355, now seen corresponding path program 1 times [2018-01-21 00:55:47,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,631 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:47,632 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,635 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:47,635 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:47,635 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:47,635 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:47,635 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:47,635 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:47,636 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:47,636 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 00:55:47,636 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:55:47,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,639 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,639 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:55:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -936073627, now seen corresponding path program 1 times [2018-01-21 00:55:47,639 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:47,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:47,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:47,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:47,673 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:47,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:55:47,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:55:47,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:55:47,674 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-01-21 00:55:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:47,682 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-01-21 00:55:47,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:55:47,682 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 00:55:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:47,683 INFO L225 Difference]: With dead ends: 95 [2018-01-21 00:55:47,683 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 00:55:47,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:55:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 00:55:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 00:55:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 00:55:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 00:55:47,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 00:55:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:47,693 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 00:55:47,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:55:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 00:55:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:55:47,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,695 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,695 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:55:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2126588567, now seen corresponding path program 1 times [2018-01-21 00:55:47,695 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:47,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:47,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:47,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:55:47,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:47,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:55:47,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:55:47,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:55:47,795 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 00:55:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:47,823 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 00:55:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:47,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 00:55:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:47,826 INFO L225 Difference]: With dead ends: 76 [2018-01-21 00:55:47,826 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 00:55:47,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:55:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 00:55:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 00:55:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:55:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:55:47,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 00:55:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:47,835 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:55:47,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:55:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:55:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:55:47,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,836 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,836 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:55:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -367041401, now seen corresponding path program 1 times [2018-01-21 00:55:47,837 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:47,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:47,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:47,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:55:47,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:47,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:55:47,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:55:47,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:55:47,901 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:55:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:47,920 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 00:55:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:55:47,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 00:55:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:47,921 INFO L225 Difference]: With dead ends: 50 [2018-01-21 00:55:47,921 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:47,922 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:55:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:47,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 00:55:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:47,922 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:47,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:55:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:47,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:47,925 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:47,925 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:47,925 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:47,925 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:47,925 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:47,925 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:47,925 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:47,925 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:55:47,925 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:55:47,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,927 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:55:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash 965137727, now seen corresponding path program 1 times [2018-01-21 00:55:47,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,929 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:47,954 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:47,956 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,957 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,958 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,958 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,959 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:47,962 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:47,962 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:47,962 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:47,963 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:47,963 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:47,963 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:47,963 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:47,963 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:55:47,963 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:55:47,966 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:47,966 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:47,966 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:55:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1802119621, now seen corresponding path program 1 times [2018-01-21 00:55:47,967 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:47,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:47,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:47,969 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:47,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:48,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:48,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:48,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:48,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:48,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:48,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:48,009 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 00:55:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:48,063 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 00:55:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:48,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 00:55:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:48,064 INFO L225 Difference]: With dead ends: 102 [2018-01-21 00:55:48,064 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:48,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:48,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 00:55:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:48,066 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:48,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:48,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:48,067 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:48,067 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:48,067 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:48,067 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:48,068 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:48,068 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:48,068 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:48,068 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:55:48,068 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 00:55:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:55:48,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:48,069 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:48,069 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2004826429, now seen corresponding path program 1 times [2018-01-21 00:55:48,070 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:48,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:48,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,071 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:48,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:48,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:48,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:55:48,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:48,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:55:48,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:55:48,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:48,104 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 00:55:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:48,163 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 00:55:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:55:48,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 00:55:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:48,164 INFO L225 Difference]: With dead ends: 102 [2018-01-21 00:55:48,164 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 00:55:48,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:55:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 00:55:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 00:55:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 00:55:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 00:55:48,170 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2018-01-21 00:55:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:48,171 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 00:55:48,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:55:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 00:55:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:55:48,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:48,172 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:48,172 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1907813883, now seen corresponding path program 1 times [2018-01-21 00:55:48,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:48,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:48,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:48,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:48,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:48,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:55:48,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:48,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:55:48,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:55:48,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:55:48,243 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 5 states. [2018-01-21 00:55:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:48,256 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-21 00:55:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:48,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 00:55:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:48,258 INFO L225 Difference]: With dead ends: 84 [2018-01-21 00:55:48,258 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 00:55:48,258 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:55:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 00:55:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 00:55:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 00:55:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-21 00:55:48,263 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2018-01-21 00:55:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:48,263 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-21 00:55:48,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:55:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-21 00:55:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:55:48,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:48,265 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:48,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1264500249, now seen corresponding path program 1 times [2018-01-21 00:55:48,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:48,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:48,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:48,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:48,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:55:48,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:48,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:55:48,311 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:48,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:55:48,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:55:48,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:55:48,312 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2018-01-21 00:55:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:48,352 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-21 00:55:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:55:48,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 00:55:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:48,353 INFO L225 Difference]: With dead ends: 54 [2018-01-21 00:55:48,353 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:48,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:55:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:48,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 00:55:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:48,355 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:48,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:55:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:48,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:48,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:55:48 BoogieIcfgContainer [2018-01-21 00:55:48,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:55:48,360 INFO L168 Benchmark]: Toolchain (without parser) took 1971.59 ms. Allocated memory was 306.7 MB in the beginning and 468.2 MB in the end (delta: 161.5 MB). Free memory was 263.9 MB in the beginning and 342.1 MB in the end (delta: -78.3 MB). Peak memory consumption was 83.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:48,361 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:55:48,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.14 ms. Allocated memory is still 306.7 MB. Free memory was 263.9 MB in the beginning and 250.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:48,361 INFO L168 Benchmark]: Boogie Preprocessor took 38.72 ms. Allocated memory is still 306.7 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:48,361 INFO L168 Benchmark]: RCFGBuilder took 290.11 ms. Allocated memory is still 306.7 MB. Free memory was 248.8 MB in the beginning and 229.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:48,362 INFO L168 Benchmark]: TraceAbstraction took 1416.36 ms. Allocated memory was 306.7 MB in the beginning and 468.2 MB in the end (delta: 161.5 MB). Free memory was 229.7 MB in the beginning and 342.1 MB in the end (delta: -112.4 MB). Peak memory consumption was 49.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:48,363 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.15 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.14 ms. Allocated memory is still 306.7 MB. Free memory was 263.9 MB in the beginning and 250.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.72 ms. Allocated memory is still 306.7 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.11 ms. Allocated memory is still 306.7 MB. Free memory was 248.8 MB in the beginning and 229.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1416.36 ms. Allocated memory was 306.7 MB in the beginning and 468.2 MB in the end (delta: 161.5 MB). Free memory was 229.7 MB in the beginning and 342.1 MB in the end (delta: -112.4 MB). Peak memory consumption was 49.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1472] CALL entry_point() [L1458] int i; [L1459] int len = 10; VAL [len=10] [L1460] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 31 SDslu, 9 SDs, 0 SdLazy, 23 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_17Err0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1472] CALL entry_point() [L1458] int i; [L1459] int len = 10; VAL [len=10] [L1460] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1460] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1460] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1461] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1472] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1471]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 26 SDslu, 9 SDs, 0 SdLazy, 23 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1457]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 6 procedures, 55 locations, 6 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 30 SDslu, 156 SDs, 0 SdLazy, 45 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-55-48-373.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-55-48-373.csv Received shutdown request...