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_precise.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-25 00:06:53,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:06:53,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:06:53,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:06:53,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:06:53,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:06:53,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:06:53,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:06:53,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:06:53,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:06:53,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:06:53,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:06:53,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:06:53,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:06:53,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:06:53,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:06:53,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:06:53,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:06:53,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:06:53,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:06:53,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:06:53,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:06:53,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:06:53,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:06:53,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:06:53,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:06:53,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:06:53,943 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:06:53,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:06:53,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:06:53,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:06:53,944 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_precise.epf [2018-01-25 00:06:53,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:06:53,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:06:53,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:06:53,954 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:06:53,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:06:53,954 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:06:53,954 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:06:53,954 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:06:53,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:06:53,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:06:53,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:06:53,956 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:06:53,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:06:53,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:06:53,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:06:53,957 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:06:53,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:06:53,958 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:06:53,959 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:06:53,959 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:06:53,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:06:54,004 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:06:54,008 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:06:54,009 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:06:54,009 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:06:54,010 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-25 00:06:54,185 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:06:54,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:06:54,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:06:54,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:06:54,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:06:54,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aa47da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54, skipping insertion in model container [2018-01-25 00:06:54,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,213 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:06:54,260 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:06:54,376 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:06:54,397 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:06:54,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54 WrapperNode [2018-01-25 00:06:54,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:06:54,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:06:54,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:06:54,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:06:54,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (1/1) ... [2018-01-25 00:06:54,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:06:54,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:06:54,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:06:54,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:06:54,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (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-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-25 00:06:54,491 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-25 00:06:54,492 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-25 00:06:54,492 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:06:54,492 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:06:54,492 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:06:54,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:06:54,680 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:06:54,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:06:54 BoogieIcfgContainer [2018-01-25 00:06:54,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:06:54,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:06:54,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:06:54,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:06:54,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:06:54" (1/3) ... [2018-01-25 00:06:54,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2348bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:06:54, skipping insertion in model container [2018-01-25 00:06:54,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:06:54" (2/3) ... [2018-01-25 00:06:54,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2348bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:06:54, skipping insertion in model container [2018-01-25 00:06:54,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:06:54" (3/3) ... [2018-01-25 00:06:54,686 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-25 00:06:54,693 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:06:54,698 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 00:06:54,738 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:06:54,738 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:06:54,738 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:06:54,738 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:06:54,739 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:06:54,739 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:06:54,739 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:06:54,739 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:06:54,740 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:06:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-25 00:06:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:06:54,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:54,769 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:06:54,769 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-01-25 00:06:54,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:54,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:54,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:54,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:54,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:54,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:54,919 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-25 00:06:54,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:54,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:06:54,921 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:54,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:06:54,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:06:54,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:06:54,937 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-25 00:06:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:55,102 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-01-25 00:06:55,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:06:55,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:06:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:55,113 INFO L225 Difference]: With dead ends: 70 [2018-01-25 00:06:55,113 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 00:06:55,117 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-25 00:06:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 00:06:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-01-25 00:06:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:06:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-25 00:06:55,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-01-25 00:06:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:55,154 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-25 00:06:55,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:06:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-25 00:06:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 00:06:55,155 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:55,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 00:06:55,155 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-01-25 00:06:55,156 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:55,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:55,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:55,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:55,250 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-25 00:06:55,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:55,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:06:55,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:55,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:06:55,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:06:55,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:06:55,255 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-01-25 00:06:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:55,323 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-01-25 00:06:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:06:55,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 00:06:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:55,325 INFO L225 Difference]: With dead ends: 112 [2018-01-25 00:06:55,326 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 00:06:55,327 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-25 00:06:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 00:06:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-01-25 00:06:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 00:06:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-01-25 00:06:55,346 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-01-25 00:06:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:55,347 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-01-25 00:06:55,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:06:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-01-25 00:06:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:55,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:55,348 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-25 00:06:55,348 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-01-25 00:06:55,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:55,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:55,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,351 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:55,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:55,486 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-25 00:06:55,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:55,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:55,487 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:55,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:06:55,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:06:55,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:06:55,488 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-01-25 00:06:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:55,519 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-25 00:06:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:06:55,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 00:06:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:55,523 INFO L225 Difference]: With dead ends: 121 [2018-01-25 00:06:55,523 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 00:06:55,524 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-25 00:06:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 00:06:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-01-25 00:06:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 00:06:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-01-25 00:06:55,536 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-01-25 00:06:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:55,537 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-01-25 00:06:55,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:06:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-01-25 00:06:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 00:06:55,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:55,538 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-25 00:06:55,538 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-01-25 00:06:55,538 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:55,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:55,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:55,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:55,647 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-25 00:06:55,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:55,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:06:55,648 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:55,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:55,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:55,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:55,649 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-01-25 00:06:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:55,717 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-01-25 00:06:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:55,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 00:06:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:55,718 INFO L225 Difference]: With dead ends: 90 [2018-01-25 00:06:55,718 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 00:06:55,719 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-25 00:06:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 00:06:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-25 00:06:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 00:06:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-25 00:06:55,727 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-01-25 00:06:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:55,727 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-25 00:06:55,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-25 00:06:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:06:55,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:55,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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:06:55,728 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-01-25 00:06:55,728 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:55,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:55,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:55,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:06:55,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:55,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:55,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:55,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:55,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:55,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:55,794 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-01-25 00:06:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:55,837 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-25 00:06:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:06:55,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:06:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:55,839 INFO L225 Difference]: With dead ends: 76 [2018-01-25 00:06:55,840 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 00:06:55,840 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-25 00:06:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 00:06:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-25 00:06:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 00:06:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-25 00:06:55,849 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-01-25 00:06:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:55,850 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-25 00:06:55,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-25 00:06:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:06:55,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:55,851 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-25 00:06:55,851 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-01-25 00:06:55,852 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:55,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:55,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:55,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:55,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:55,934 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-25 00:06:55,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:55,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:55,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:55,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:06:55,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:06:55,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:06:55,936 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-01-25 00:06:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:56,041 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 00:06:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:06:56,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 00:06:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:56,043 INFO L225 Difference]: With dead ends: 75 [2018-01-25 00:06:56,043 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 00:06:56,044 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-25 00:06:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 00:06:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 00:06:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 00:06:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-25 00:06:56,054 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-01-25 00:06:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:56,055 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-25 00:06:56,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:06:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-25 00:06:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:06:56,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:56,057 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-25 00:06:56,057 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-01-25 00:06:56,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:56,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:56,105 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-25 00:06:56,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:56,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:06:56,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:56,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:06:56,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:06:56,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:06:56,107 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-01-25 00:06:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:56,191 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-25 00:06:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:06:56,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-25 00:06:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:56,193 INFO L225 Difference]: With dead ends: 78 [2018-01-25 00:06:56,193 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 00:06:56,193 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-25 00:06:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 00:06:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 00:06:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 00:06:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-25 00:06:56,198 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-01-25 00:06:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:56,199 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-25 00:06:56,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:06:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-25 00:06:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:56,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:56,199 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-25 00:06:56,200 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-01-25 00:06:56,200 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:56,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:56,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:56,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:56,350 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-25 00:06:56,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:56,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:06:56,351 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:56,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:06:56,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:06:56,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:06:56,358 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-01-25 00:06:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:56,703 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-25 00:06:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:06:56,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:06:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:56,705 INFO L225 Difference]: With dead ends: 66 [2018-01-25 00:06:56,705 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 00:06:56,705 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:06:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 00:06:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-25 00:06:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 00:06:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-25 00:06:56,711 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 32 [2018-01-25 00:06:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:56,711 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-25 00:06:56,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:06:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-25 00:06:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:56,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:56,712 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-25 00:06:56,713 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706417, now seen corresponding path program 1 times [2018-01-25 00:06:56,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:56,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:56,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:56,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:56,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:56,905 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-25 00:06:56,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:56,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:06:56,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:56,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:06:56,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:06:56,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:06:56,907 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-01-25 00:06:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:57,367 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-25 00:06:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 00:06:57,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-25 00:06:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:57,369 INFO L225 Difference]: With dead ends: 60 [2018-01-25 00:06:57,369 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 00:06:57,369 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-25 00:06:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 00:06:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 00:06:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 00:06:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-25 00:06:57,378 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 32 [2018-01-25 00:06:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:57,378 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-25 00:06:57,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:06:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-25 00:06:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:06:57,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:57,379 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-25 00:06:57,379 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:57,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2490893, now seen corresponding path program 1 times [2018-01-25 00:06:57,380 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:57,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:57,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:57,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:57,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:57,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:57,681 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-25 00:06:57,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:57,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:06:57,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:57,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:06:57,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:06:57,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:06:57,683 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-01-25 00:06:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:58,160 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-01-25 00:06:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:06:58,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-25 00:06:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:58,161 INFO L225 Difference]: With dead ends: 62 [2018-01-25 00:06:58,162 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 00:06:58,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:06:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 00:06:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 00:06:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 00:06:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-25 00:06:58,170 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2018-01-25 00:06:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:58,170 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-25 00:06:58,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:06:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-25 00:06:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 00:06:58,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:58,171 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-25 00:06:58,172 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2029507581, now seen corresponding path program 1 times [2018-01-25 00:06:58,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:58,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:58,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:58,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:58,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:06:58,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:06:58,259 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-25 00:06:58,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:06:58,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:06:58,260 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:06:58,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:06:58,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:06:58,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:06:58,261 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-01-25 00:06:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:06:58,297 INFO L93 Difference]: Finished difference Result 51 states and 50 transitions. [2018-01-25 00:06:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:06:58,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-25 00:06:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:06:58,298 INFO L225 Difference]: With dead ends: 51 [2018-01-25 00:06:58,298 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 00:06:58,298 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-25 00:06:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 00:06:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 00:06:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 00:06:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-01-25 00:06:58,303 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-01-25 00:06:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:06:58,304 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-01-25 00:06:58,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:06:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-01-25 00:06:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 00:06:58,306 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:06:58,306 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-25 00:06:58,306 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-25 00:06:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1307871834, now seen corresponding path program 1 times [2018-01-25 00:06:58,306 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:06:58,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:58,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:06:58,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:06:58,308 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:06:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:06:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 00:06:58,370 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 00:06:58,389 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 00:06:58,393 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:58,393 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:58,394 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:58,394 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-25 00:06:58,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:06:58 BoogieIcfgContainer [2018-01-25 00:06:58,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:06:58,410 INFO L168 Benchmark]: Toolchain (without parser) took 4223.64 ms. Allocated memory was 308.3 MB in the beginning and 508.6 MB in the end (delta: 200.3 MB). Free memory was 267.2 MB in the beginning and 374.9 MB in the end (delta: -107.7 MB). Peak memory consumption was 92.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:58,411 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:06:58,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.40 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 253.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:58,411 INFO L168 Benchmark]: Boogie Preprocessor took 35.44 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:58,412 INFO L168 Benchmark]: RCFGBuilder took 237.17 ms. Allocated memory is still 308.3 MB. Free memory was 251.2 MB in the beginning and 232.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:58,412 INFO L168 Benchmark]: TraceAbstraction took 3727.43 ms. Allocated memory was 308.3 MB in the beginning and 508.6 MB in the end (delta: 200.3 MB). Free memory was 232.2 MB in the beginning and 374.9 MB in the end (delta: -142.7 MB). Peak memory consumption was 57.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:06:58,414 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.11 ms. Allocated memory is still 308.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.40 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 253.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.44 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 237.17 ms. Allocated memory is still 308.3 MB. Free memory was 251.2 MB in the beginning and 232.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3727.43 ms. Allocated memory was 308.3 MB in the beginning and 508.6 MB in the end (delta: 200.3 MB). Free memory was 232.2 MB in the beginning and 374.9 MB in the end (delta: -142.7 MB). Peak memory consumption was 57.6 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 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$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 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.9s 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.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s 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_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-06-58-421.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_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-06-58-421.csv Received shutdown request...