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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:28:49,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:28:49,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:28:49,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:28:49,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:28:49,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:28:49,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:28:49,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:28:49,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:28:49,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:28:49,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:28:49,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:28:49,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:28:49,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:28:49,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:28:49,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:28:49,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:28:49,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:28:49,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:28:49,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:28:49,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:28:49,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:28:49,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:28:49,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:28:49,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:28:49,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:28:49,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:28:49,603 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:28:49,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:28:49,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:28:49,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:28:49,604 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_mostprecise.epf [2018-01-21 03:28:49,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:28:49,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:28:49,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:28:49,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:28:49,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:28:49,616 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:28:49,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:28:49,616 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:28:49,617 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:28:49,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:28:49,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:28:49,618 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:28:49,618 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:28:49,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:28:49,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:28:49,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:28:49,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:28:49,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:28:49,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:28:49,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:28:49,620 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:28:49,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:28:49,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:28:49,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:28:49,621 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:28:49,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:28:49,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:28:49,622 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:28:49,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:28:49,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:28:49,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:28:49,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:28:49,623 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:28:49,624 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:28:49,624 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:28:49,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:28:49,674 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:28:49,677 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:28:49,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:28:49,679 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:28:49,679 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 03:28:49,932 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:28:49,938 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:28:49,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:28:49,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:28:49,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:28:49,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:28:49" (1/1) ... [2018-01-21 03:28:49,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc29a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:49, skipping insertion in model container [2018-01-21 03:28:49,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:28:49" (1/1) ... [2018-01-21 03:28:49,964 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:28:50,014 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:28:50,140 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:28:50,165 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:28:50,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50 WrapperNode [2018-01-21 03:28:50,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:28:50,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:28:50,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:28:50,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:28:50,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (1/1) ... [2018-01-21 03:28:50,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:28:50,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:28:50,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:28:50,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:28:50,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (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 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 03:28:50,286 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:28:50,287 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:28:50,288 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:28:50,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:28:50,529 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:28:50,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:28:50 BoogieIcfgContainer [2018-01-21 03:28:50,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:28:50,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:28:50,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:28:50,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:28:50,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:28:49" (1/3) ... [2018-01-21 03:28:50,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59235708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:28:50, skipping insertion in model container [2018-01-21 03:28:50,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:50" (2/3) ... [2018-01-21 03:28:50,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59235708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:28:50, skipping insertion in model container [2018-01-21 03:28:50,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:28:50" (3/3) ... [2018-01-21 03:28:50,541 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-21 03:28:50,551 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:28:50,572 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 03:28:50,638 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:50,638 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:50,638 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:50,639 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:50,639 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:50,639 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:50,639 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:50,639 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 03:28:50,640 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 03:28:50,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:50,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:50,667 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:28:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2086039493, now seen corresponding path program 1 times [2018-01-21 03:28:50,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:50,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:50,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:50,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:50,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:50,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:50,850 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 03:28:50,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:50,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:50,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:50,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:50,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:50,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:50,875 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 03:28:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:51,161 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 03:28:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:51,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 03:28:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:51,173 INFO L225 Difference]: With dead ends: 102 [2018-01-21 03:28:51,173 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 03:28:51,178 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 03:28:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 03:28:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 03:28:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 03:28:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 03:28:51,230 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 03:28:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:51,230 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 03:28:51,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 03:28:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 03:28:51,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,233 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:51,233 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:28:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1065867417, now seen corresponding path program 1 times [2018-01-21 03:28:51,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,312 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:51,321 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,322 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,335 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:51,335 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:51,335 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:51,335 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:51,335 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:51,335 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:51,336 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:51,336 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:28:51,336 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:28:51,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,338 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:28:51,338 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:28:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 124355, now seen corresponding path program 1 times [2018-01-21 03:28:51,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,355 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:51,356 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,357 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:51,357 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:51,357 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:51,357 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:51,358 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:51,358 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:51,358 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:51,358 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 03:28:51,358 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:28:51,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,362 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 03:28:51,362 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash -936073627, now seen corresponding path program 1 times [2018-01-21 03:28:51,362 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:51,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:28:51,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:51,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:51,418 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:51,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:28:51,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:28:51,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:28:51,422 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-01-21 03:28:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:51,433 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-01-21 03:28:51,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:28:51,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 03:28:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:51,439 INFO L225 Difference]: With dead ends: 95 [2018-01-21 03:28:51,439 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 03:28:51,441 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 03:28:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 03:28:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 03:28:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 03:28:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 03:28:51,450 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 03:28:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:51,453 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 03:28:51,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:28:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 03:28:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 03:28:51,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,454 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 03:28:51,454 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2126588567, now seen corresponding path program 1 times [2018-01-21 03:28:51,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:51,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:51,580 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 03:28:51,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:51,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:28:51,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:51,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:28:51,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:28:51,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:51,582 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 03:28:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:51,620 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 03:28:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:28:51,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 03:28:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:51,623 INFO L225 Difference]: With dead ends: 76 [2018-01-21 03:28:51,623 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 03:28:51,624 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 03:28:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 03:28:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 03:28:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 03:28:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 03:28:51,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 03:28:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:51,630 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 03:28:51,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:28:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 03:28:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 03:28:51,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,631 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 03:28:51,631 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -367041401, now seen corresponding path program 1 times [2018-01-21 03:28:51,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:51,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:51,690 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 03:28:51,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:51,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:28:51,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:51,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:28:51,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:28:51,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:28:51,692 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 03:28:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:51,717 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 03:28:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:28:51,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 03:28:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:51,719 INFO L225 Difference]: With dead ends: 50 [2018-01-21 03:28:51,719 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:51,719 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 03:28:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:51,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 03:28:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:51,721 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:51,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:28:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:51,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:51,724 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:51,724 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:51,725 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:51,725 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:51,725 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:51,725 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:51,725 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:51,725 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:28:51,725 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:28:51,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,728 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 03:28:51,729 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:28:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 965137727, now seen corresponding path program 1 times [2018-01-21 03:28:51,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:51,757 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:51,759 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,760 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,760 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,761 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,761 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:51,764 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:51,764 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:51,765 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:51,765 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:51,765 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:51,765 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:51,765 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:51,765 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:28:51,765 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 03:28:51,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,768 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 03:28:51,768 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:28:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1802119621, now seen corresponding path program 1 times [2018-01-21 03:28:51,768 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:51,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:51,819 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 03:28:51,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:51,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:51,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:51,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:51,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:51,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:51,821 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 03:28:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:51,877 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 03:28:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:51,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 03:28:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:51,877 INFO L225 Difference]: With dead ends: 102 [2018-01-21 03:28:51,877 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:51,878 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 03:28:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:51,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 03:28:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:51,879 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:51,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:51,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:51,880 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:51,880 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:51,881 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:51,881 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:51,881 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:51,881 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:51,881 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:51,881 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 03:28:51,881 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-21 03:28:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 03:28:51,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:51,883 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:51,883 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:28:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2004826429, now seen corresponding path program 1 times [2018-01-21 03:28:51,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:51,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:51,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:51,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:51,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:51,911 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 03:28:51,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:51,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:51,911 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:51,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:51,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:51,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:51,912 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 3 states. [2018-01-21 03:28:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:52,028 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-01-21 03:28:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:52,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 03:28:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:52,030 INFO L225 Difference]: With dead ends: 102 [2018-01-21 03:28:52,030 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 03:28:52,031 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 03:28:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 03:28:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 03:28:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 03:28:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 03:28:52,039 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2018-01-21 03:28:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:52,039 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 03:28:52,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 03:28:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 03:28:52,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:52,041 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 03:28:52,041 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:28:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1907813883, now seen corresponding path program 1 times [2018-01-21 03:28:52,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:52,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:52,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:52,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:52,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:52,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:52,135 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 03:28:52,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:52,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:28:52,135 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:52,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:28:52,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:28:52,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:52,136 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 5 states. [2018-01-21 03:28:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:52,152 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-21 03:28:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:28:52,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 03:28:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:52,155 INFO L225 Difference]: With dead ends: 84 [2018-01-21 03:28:52,155 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 03:28:52,155 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 03:28:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 03:28:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 03:28:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 03:28:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-21 03:28:52,163 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2018-01-21 03:28:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:52,164 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-21 03:28:52,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:28:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-21 03:28:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 03:28:52,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:52,165 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 03:28:52,166 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:28:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1264500249, now seen corresponding path program 1 times [2018-01-21 03:28:52,166 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:52,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:52,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:52,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:52,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:52,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:52,219 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 03:28:52,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:52,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:28:52,223 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:52,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:28:52,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:28:52,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:28:52,224 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2018-01-21 03:28:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:52,259 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-21 03:28:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:28:52,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 03:28:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:52,260 INFO L225 Difference]: With dead ends: 54 [2018-01-21 03:28:52,260 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:52,261 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 03:28:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:52,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 03:28:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:52,262 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:52,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:28:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:52,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:52,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:28:52 BoogieIcfgContainer [2018-01-21 03:28:52,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:28:52,267 INFO L168 Benchmark]: Toolchain (without parser) took 2334.36 ms. Allocated memory was 309.3 MB in the beginning and 453.0 MB in the end (delta: 143.7 MB). Free memory was 268.1 MB in the beginning and 423.9 MB in the end (delta: -155.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:28:52,268 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:28:52,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.70 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 254.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:52,268 INFO L168 Benchmark]: Boogie Preprocessor took 41.26 ms. Allocated memory is still 309.3 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:52,269 INFO L168 Benchmark]: RCFGBuilder took 314.86 ms. Allocated memory is still 309.3 MB. Free memory was 252.1 MB in the beginning and 233.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:52,269 INFO L168 Benchmark]: TraceAbstraction took 1735.80 ms. Allocated memory was 309.3 MB in the beginning and 453.0 MB in the end (delta: 143.7 MB). Free memory was 233.1 MB in the beginning and 423.9 MB in the end (delta: -190.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:28:52,270 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.12 ms. Allocated memory is still 309.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.70 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 254.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.26 ms. Allocated memory is still 309.3 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 314.86 ms. Allocated memory is still 309.3 MB. Free memory was 252.1 MB in the beginning and 233.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1735.80 ms. Allocated memory was 309.3 MB in the beginning and 453.0 MB in the end (delta: 143.7 MB). Free memory was 233.1 MB in the beginning and 423.9 MB in the end (delta: -190.8 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s 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.3s 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.3s 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.1s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-28-52-280.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-28-52-280.csv Received shutdown request...