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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:58:43,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:58:43,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:58:43,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:58:43,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:58:43,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:58:43,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:58:43,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:58:43,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:58:43,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:58:43,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:58:43,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:58:43,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:58:43,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:58:43,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:58:43,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:58:43,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:58:43,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:58:43,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:58:43,983 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:58:43,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:58:43,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:58:43,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:58:43,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:58:43,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:58:43,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:58:43,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:58:43,990 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:58:43,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:58:43,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:58:43,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:58:43,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:58:44,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:58:44,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:58:44,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:58:44,003 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:58:44,003 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:58:44,003 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:58:44,003 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:58:44,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:58:44,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:58:44,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:58:44,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:58:44,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:58:44,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:58:44,005 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:58:44,005 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:58:44,005 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:58:44,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:58:44,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:58:44,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:58:44,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:58:44,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:58:44,007 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:58:44,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:58:44,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:58:44,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:58:44,007 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:58:44,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:58:44,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:58:44,008 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:58:44,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:58:44,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:58:44,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:58:44,009 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:58:44,010 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:58:44,010 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:58:44,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:58:44,060 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:58:44,064 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:58:44,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:58:44,066 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:58:44,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-24 15:58:44,267 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:58:44,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:58:44,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:58:44,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:58:44,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:58:44,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c336041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44, skipping insertion in model container [2018-01-24 15:58:44,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,298 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:58:44,349 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:58:44,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:58:44,480 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:58:44,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44 WrapperNode [2018-01-24 15:58:44,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:58:44,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:58:44,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:58:44,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:58:44,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (1/1) ... [2018-01-24 15:58:44,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:58:44,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:58:44,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:58:44,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:58:44,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (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-24 15:58:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:58:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:58:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:58:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-24 15:58:44,577 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-24 15:58:44,578 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-24 15:58:44,578 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-24 15:58:44,578 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:58:44,578 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:58:44,578 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:58:44,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:58:44,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:58:44,808 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:58:44,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:58:44 BoogieIcfgContainer [2018-01-24 15:58:44,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:58:44,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:58:44,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:58:44,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:58:44,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:58:44" (1/3) ... [2018-01-24 15:58:44,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:58:44, skipping insertion in model container [2018-01-24 15:58:44,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:58:44" (2/3) ... [2018-01-24 15:58:44,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332f29fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:58:44, skipping insertion in model container [2018-01-24 15:58:44,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:58:44" (3/3) ... [2018-01-24 15:58:44,816 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-24 15:58:44,823 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:58:44,829 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 15:58:44,868 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:58:44,868 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:58:44,868 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:58:44,868 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:58:44,868 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:58:44,869 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:58:44,869 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:58:44,869 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:58:44,869 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:58:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-24 15:58:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:58:44,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:44,893 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:58:44,893 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-01-24 15:58:44,899 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:44,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:44,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:44,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:44,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:44,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:45,044 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-24 15:58:45,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:45,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:58:45,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:45,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:58:45,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:58:45,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:58:45,069 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-24 15:58:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:45,265 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-01-24 15:58:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:58:45,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:58:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:45,277 INFO L225 Difference]: With dead ends: 70 [2018-01-24 15:58:45,277 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:58:45,281 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-24 15:58:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:58:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-01-24 15:58:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 15:58:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-24 15:58:45,319 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-01-24 15:58:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:45,319 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-24 15:58:45,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:58:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-24 15:58:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:58:45,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:45,320 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:58:45,321 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:45,321 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-01-24 15:58:45,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:45,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:45,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:45,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:45,392 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-24 15:58:45,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:45,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:58:45,422 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:45,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:58:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:58:45,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:58:45,425 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-01-24 15:58:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:45,491 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-01-24 15:58:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:58:45,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:58:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:45,494 INFO L225 Difference]: With dead ends: 112 [2018-01-24 15:58:45,494 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 15:58:45,495 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-24 15:58:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 15:58:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-01-24 15:58:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 15:58:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-01-24 15:58:45,515 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-01-24 15:58:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:45,516 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-01-24 15:58:45,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:58:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-01-24 15:58:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:58:45,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:45,518 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-24 15:58:45,518 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-01-24 15:58:45,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:45,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:45,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:45,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:45,653 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-24 15:58:45,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:45,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:58:45,653 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:45,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:58:45,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:58:45,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:58:45,655 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-01-24 15:58:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:45,691 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-24 15:58:45,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:58:45,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 15:58:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:45,694 INFO L225 Difference]: With dead ends: 121 [2018-01-24 15:58:45,695 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 15:58:45,695 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-24 15:58:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 15:58:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-01-24 15:58:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 15:58:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-01-24 15:58:45,704 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-01-24 15:58:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:45,704 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-01-24 15:58:45,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:58:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-01-24 15:58:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:58:45,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:45,705 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-24 15:58:45,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-01-24 15:58:45,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:45,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:45,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,708 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:45,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:45,805 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-24 15:58:45,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:45,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:58:45,806 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:45,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:58:45,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:58:45,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:58:45,807 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-01-24 15:58:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:45,872 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-01-24 15:58:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:58:45,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 15:58:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:45,874 INFO L225 Difference]: With dead ends: 90 [2018-01-24 15:58:45,874 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 15:58:45,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:58:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 15:58:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 15:58:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 15:58:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-24 15:58:45,886 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-01-24 15:58:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:45,886 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-24 15:58:45,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:58:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-24 15:58:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:58:45,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:45,888 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-24 15:58:45,888 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-01-24 15:58:45,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:45,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:45,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:45,890 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:45,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:45,978 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-24 15:58:45,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:45,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:58:45,978 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:45,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:58:45,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:58:45,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:58:45,979 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-01-24 15:58:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:46,029 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-24 15:58:46,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:58:46,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 15:58:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:46,031 INFO L225 Difference]: With dead ends: 76 [2018-01-24 15:58:46,031 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 15:58:46,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:58:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 15:58:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 15:58:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 15:58:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-24 15:58:46,042 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-01-24 15:58:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:46,042 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-24 15:58:46,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:58:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-24 15:58:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:58:46,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:46,044 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-24 15:58:46,044 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-01-24 15:58:46,045 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:46,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:46,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:46,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:46,124 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-24 15:58:46,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:46,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:58:46,125 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:46,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:58:46,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:58:46,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:58:46,127 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-01-24 15:58:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:46,219 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 15:58:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:58:46,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 15:58:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:46,220 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:58:46,221 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:58:46,221 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:58:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:58:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 15:58:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 15:58:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-24 15:58:46,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-01-24 15:58:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:46,230 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-24 15:58:46,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:58:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-24 15:58:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:58:46,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:46,232 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] [2018-01-24 15:58:46,232 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-01-24 15:58:46,233 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:46,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:46,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:46,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:46,290 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-24 15:58:46,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:46,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:58:46,291 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:46,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:58:46,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:58:46,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:58:46,292 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-01-24 15:58:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:46,356 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 15:58:46,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:58:46,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-24 15:58:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:46,358 INFO L225 Difference]: With dead ends: 78 [2018-01-24 15:58:46,358 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 15:58:46,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:58:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 15:58:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 15:58:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:58:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 15:58:46,373 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-01-24 15:58:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:46,373 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 15:58:46,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:58:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 15:58:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:58:46,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:46,375 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:58:46,375 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-01-24 15:58:46,375 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:46,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:46,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:46,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:46,581 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-24 15:58:46,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:46,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:58:46,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:46,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:58:46,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:58:46,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:58:46,582 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-01-24 15:58:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:46,958 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-24 15:58:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:58:46,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 15:58:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:46,960 INFO L225 Difference]: With dead ends: 66 [2018-01-24 15:58:46,960 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:58:46,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:58:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:58:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-24 15:58:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 15:58:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-24 15:58:46,970 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 32 [2018-01-24 15:58:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:46,971 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-24 15:58:46,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:58:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-24 15:58:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:58:46,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:46,972 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:58:46,973 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706417, now seen corresponding path program 1 times [2018-01-24 15:58:46,973 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:46,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:46,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:46,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:46,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:47,194 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-24 15:58:47,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:47,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:58:47,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:47,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:58:47,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:58:47,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:58:47,196 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-01-24 15:58:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:47,649 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-24 15:58:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:58:47,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-24 15:58:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:47,650 INFO L225 Difference]: With dead ends: 60 [2018-01-24 15:58:47,650 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 15:58:47,650 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:58:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 15:58:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-24 15:58:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 15:58:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-24 15:58:47,658 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 32 [2018-01-24 15:58:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:47,658 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-24 15:58:47,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:58:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-24 15:58:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:58:47,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:47,659 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:58:47,660 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2490893, now seen corresponding path program 1 times [2018-01-24 15:58:47,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:47,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:47,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:47,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:47,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:47,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:47,983 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-24 15:58:47,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:47,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:58:47,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:47,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:58:47,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:58:47,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:58:47,985 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-01-24 15:58:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:48,255 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-01-24 15:58:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:58:48,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-24 15:58:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:48,256 INFO L225 Difference]: With dead ends: 62 [2018-01-24 15:58:48,256 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:58:48,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:58:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:58:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:58:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:58:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-24 15:58:48,263 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2018-01-24 15:58:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:48,263 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-24 15:58:48,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:58:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-24 15:58:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:58:48,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:48,264 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:58:48,264 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2029507581, now seen corresponding path program 1 times [2018-01-24 15:58:48,264 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:48,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:48,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:48,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:48,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:58:48,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:58:48,323 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-24 15:58:48,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:58:48,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:58:48,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:58:48,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:58:48,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:58:48,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:58:48,324 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-01-24 15:58:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:58:48,336 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2018-01-24 15:58:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:58:48,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 15:58:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:58:48,337 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:58:48,338 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:58:48,338 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-24 15:58:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:58:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:58:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:58:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-01-24 15:58:48,348 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-01-24 15:58:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:58:48,348 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-01-24 15:58:48,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:58:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-01-24 15:58:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 15:58:48,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:58:48,350 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:58:48,350 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-24 15:58:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1307871834, now seen corresponding path program 1 times [2018-01-24 15:58:48,350 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:58:48,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:48,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:58:48,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:58:48,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:58:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 15:58:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 15:58:48,424 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 15:58:48,444 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 15:58:48,449 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 15:58:48,449 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 15:58:48,450 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 15:58:48,450 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-24 15:58:48,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:58:48 BoogieIcfgContainer [2018-01-24 15:58:48,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:58:48,464 INFO L168 Benchmark]: Toolchain (without parser) took 4197.14 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 253.6 MB in the beginning and 394.6 MB in the end (delta: -140.9 MB). Peak memory consumption was 67.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:48,465 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 296.7 MB. Free memory is still 260.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:58:48,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.23 ms. Allocated memory is still 296.7 MB. Free memory was 253.6 MB in the beginning and 240.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:48,466 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 296.7 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:48,466 INFO L168 Benchmark]: RCFGBuilder took 284.61 ms. Allocated memory is still 296.7 MB. Free memory was 238.3 MB in the beginning and 219.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:48,467 INFO L168 Benchmark]: TraceAbstraction took 3653.46 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 219.3 MB in the beginning and 394.6 MB in the end (delta: -175.3 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:58:48,469 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 296.7 MB. Free memory is still 260.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.23 ms. Allocated memory is still 296.7 MB. Free memory was 253.6 MB in the beginning and 240.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 296.7 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.61 ms. Allocated memory is still 296.7 MB. Free memory was 238.3 MB in the beginning and 219.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3653.46 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 219.3 MB in the beginning and 394.6 MB in the end (delta: -175.3 MB). Peak memory consumption was 32.9 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={9:5}] [L1465] FCALL struct A a6; VAL [a6={7:0}] [L1477] CALL entry_point() VAL [a6={7:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={7:0}, a6={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, a6={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={7:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, a6={7:0}, malloc(size)={8:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={8:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={8:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={8:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={7:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={7:0}, ret=0] [L1473] RET, FCALL a6.p = 0 VAL [a6={7:0}, ret=0] [L1477] entry_point() VAL [a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 9 error locations. UNSAFE Result, 3.6s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 391 SDslu, 1189 SDs, 0 SdLazy, 717 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 33451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-58-48-475.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-58-48-475.csv Received shutdown request...