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_test3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:12:14,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:12:14,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:12:14,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:12:14,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:12:14,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:12:14,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:12:14,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:12:14,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:12:14,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:12:14,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:12:14,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:12:14,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:12:14,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:12:14,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:12:14,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:12:14,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:12:14,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:12:14,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:12:14,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:12:14,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:12:14,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:12:14,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:12:14,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:12:14,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:12:14,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:12:14,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:12:14,915 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:12:14,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:12:14,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:12:14,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:12:14,916 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:12:14,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:12:14,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:12:14,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:12:14,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:12:14,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:12:14,928 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:12:14,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:12:14,928 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:12:14,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:12:14,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:12:14,929 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:12:14,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:12:14,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:12:14,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:12:14,930 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:12:14,930 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:12:14,930 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:12:14,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:12:14,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:12:14,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:12:14,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:12:14,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:12:14,931 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:12:14,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:12:14,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:12:14,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:12:14,932 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:12:14,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:12:14,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:12:14,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:12:14,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:12:14,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:12:14,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:12:14,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:12:14,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:12:14,935 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:12:14,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:12:14,983 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:12:14,987 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:12:14,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:12:14,989 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:12:14,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-25 00:12:15,178 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:12:15,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:12:15,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:12:15,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:12:15,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:12:15,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15, skipping insertion in model container [2018-01-25 00:12:15,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,210 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:12:15,260 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:12:15,369 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:12:15,381 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:12:15,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15 WrapperNode [2018-01-25 00:12:15,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:12:15,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:12:15,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:12:15,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:12:15,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (1/1) ... [2018-01-25 00:12:15,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:12:15,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:12:15,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:12:15,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:12:15,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (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:12:15,487 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:12:15,487 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:12:15,487 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:12:15,487 INFO L136 BoogieDeclarations]: Found implementation of procedure h_safe [2018-01-25 00:12:15,488 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:12:15,488 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:12:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:12:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:12:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:12:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:12:15,488 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure h_safe [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:12:15,489 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:12:15,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:12:15,644 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:12:15,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:12:15 BoogieIcfgContainer [2018-01-25 00:12:15,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:12:15,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:12:15,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:12:15,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:12:15,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:12:15" (1/3) ... [2018-01-25 00:12:15,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2cad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:12:15, skipping insertion in model container [2018-01-25 00:12:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:12:15" (2/3) ... [2018-01-25 00:12:15,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec2cad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:12:15, skipping insertion in model container [2018-01-25 00:12:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:12:15" (3/3) ... [2018-01-25 00:12:15,650 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-25 00:12:15,658 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:12:15,664 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 00:12:15,712 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:12:15,712 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:12:15,712 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:12:15,712 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:12:15,713 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:12:15,713 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:12:15,713 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:12:15,713 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:12:15,714 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:12:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-25 00:12:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 00:12:15,742 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:15,743 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:15,743 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -36513995, now seen corresponding path program 1 times [2018-01-25 00:12:15,751 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:15,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:15,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:15,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:15,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:15,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:12:16,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:12:16,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:12:16,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:12:16,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,030 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-01-25 00:12:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,162 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-01-25 00:12:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:12:16,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 00:12:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,175 INFO L225 Difference]: With dead ends: 39 [2018-01-25 00:12:16,175 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 00:12:16,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 00:12:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-25 00:12:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 00:12:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-25 00:12:16,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2018-01-25 00:12:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,206 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-25 00:12:16,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:12:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-25 00:12:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 00:12:16,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:16,207 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash -36513994, now seen corresponding path program 1 times [2018-01-25 00:12:16,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:16,307 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:12:16,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:12:16,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:12:16,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:12:16,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,310 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2018-01-25 00:12:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,403 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 00:12:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:12:16,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 00:12:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,406 INFO L225 Difference]: With dead ends: 37 [2018-01-25 00:12:16,406 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 00:12:16,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 00:12:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-01-25 00:12:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 00:12:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 00:12:16,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-25 00:12:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,414 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 00:12:16,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:12:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 00:12:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:12:16,415 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,416 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:16,416 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 133826739, now seen corresponding path program 1 times [2018-01-25 00:12:16,416 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,418 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:16,550 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:12:16,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:16,551 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:16,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:16,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:16,552 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-25 00:12:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,597 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-25 00:12:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:12:16,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 00:12:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,598 INFO L225 Difference]: With dead ends: 34 [2018-01-25 00:12:16,599 INFO L226 Difference]: Without dead ends: 33 [2018-01-25 00:12:16,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:12:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-25 00:12:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-25 00:12:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 00:12:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-25 00:12:16,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2018-01-25 00:12:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,603 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-25 00:12:16,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-25 00:12:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:12:16,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,604 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:16,604 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash 133826740, now seen corresponding path program 1 times [2018-01-25 00:12:16,604 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,606 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:16,692 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:12:16,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:16,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:16,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:16,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:16,693 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2018-01-25 00:12:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,782 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 00:12:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 00:12:16,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 00:12:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,783 INFO L225 Difference]: With dead ends: 35 [2018-01-25 00:12:16,783 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 00:12:16,783 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:12:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 00:12:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-01-25 00:12:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 00:12:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-25 00:12:16,787 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-01-25 00:12:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,787 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-25 00:12:16,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-25 00:12:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:12:16,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,788 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:16,788 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,788 INFO L82 PathProgramCache]: Analyzing trace with hash -730055936, now seen corresponding path program 1 times [2018-01-25 00:12:16,788 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,790 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:16,823 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:12:16,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:12:16,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:12:16,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:12:16,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:12:16,825 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-01-25 00:12:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,843 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-01-25 00:12:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:12:16,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-25 00:12:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,844 INFO L225 Difference]: With dead ends: 36 [2018-01-25 00:12:16,844 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 00:12:16,845 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:12:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 00:12:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-25 00:12:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 00:12:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-25 00:12:16,850 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2018-01-25 00:12:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,850 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-25 00:12:16,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:12:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-25 00:12:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:12:16,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,852 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] [2018-01-25 00:12:16,852 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1161698987, now seen corresponding path program 1 times [2018-01-25 00:12:16,852 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,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:12:16,935 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:12:16,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:16,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:12:16,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:16,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:12:16,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:12:16,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,936 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 7 states. [2018-01-25 00:12:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:16,958 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-01-25 00:12:16,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:12:16,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 00:12:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:16,960 INFO L225 Difference]: With dead ends: 38 [2018-01-25 00:12:16,960 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 00:12:16,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:12:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 00:12:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-01-25 00:12:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 00:12:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-01-25 00:12:16,964 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-01-25 00:12:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:16,964 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-01-25 00:12:16,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:12:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-01-25 00:12:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:12:16,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:16,965 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:12:16,965 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash -241367810, now seen corresponding path program 1 times [2018-01-25 00:12:16,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:16,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:16,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:16,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:16,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:17,079 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:12:17,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:17,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:12:17,080 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:17,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:12:17,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:12:17,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:12:17,081 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-01-25 00:12:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:17,112 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-25 00:12:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 00:12:17,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 00:12:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:17,117 INFO L225 Difference]: With dead ends: 28 [2018-01-25 00:12:17,118 INFO L226 Difference]: Without dead ends: 24 [2018-01-25 00:12:17,118 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:12:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-25 00:12:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-25 00:12:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 00:12:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-01-25 00:12:17,122 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2018-01-25 00:12:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:17,123 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-01-25 00:12:17,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:12:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-01-25 00:12:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:12:17,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:12:17,124 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] [2018-01-25 00:12:17,124 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 00:12:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1102731031, now seen corresponding path program 1 times [2018-01-25 00:12:17,124 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:12:17,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:17,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:12:17,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:12:17,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:12:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:12:17,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:12:17,366 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:12:17,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:12:17,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:12:17,367 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:12:17,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:12:17,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:12:17,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:12:17,368 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 9 states. [2018-01-25 00:12:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:12:17,546 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-01-25 00:12:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:12:17,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 00:12:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:12:17,548 INFO L225 Difference]: With dead ends: 24 [2018-01-25 00:12:17,548 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 00:12:17,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 00:12:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 00:12:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 00:12:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 00:12:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 00:12:17,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-25 00:12:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:12:17,549 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 00:12:17,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:12:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 00:12:17,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 00:12:17,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 00:12:17,579 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 00:12:17,579 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 00:12:17,579 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 00:12:17,580 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,580 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1444) the Hoare annotation is: true [2018-01-25 00:12:17,581 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,581 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1444) the Hoare annotation is: true [2018-01-25 00:12:17,581 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,581 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1442 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 00:12:17,581 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,581 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,581 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,582 INFO L397 ceAbstractionStarter]: At program point h_safeENTRY(lines 1433 1435) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 00:12:17,582 INFO L401 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-25 00:12:17,582 INFO L401 ceAbstractionStarter]: For program point h_safeFINAL(lines 1433 1435) no Hoare annotation was computed. [2018-01-25 00:12:17,582 INFO L401 ceAbstractionStarter]: For program point h_safeEXIT(lines 1433 1435) no Hoare annotation was computed. [2018-01-25 00:12:17,582 INFO L401 ceAbstractionStarter]: For program point L1438(line 1438) no Hoare annotation was computed. [2018-01-25 00:12:17,582 INFO L401 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-25 00:12:17,583 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1437 1440) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 00:12:17,583 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,583 INFO L401 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-25 00:12:17,583 INFO L401 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-25 00:12:17,583 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1437 1440) no Hoare annotation was computed. [2018-01-25 00:12:17,583 INFO L401 ceAbstractionStarter]: For program point L1439'''(line 1439) no Hoare annotation was computed. [2018-01-25 00:12:17,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:12:17 BoogieIcfgContainer [2018-01-25 00:12:17,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:12:17,587 INFO L168 Benchmark]: Toolchain (without parser) took 2408.06 ms. Allocated memory was 297.8 MB in the beginning and 467.7 MB in the end (delta: 169.9 MB). Free memory was 256.7 MB in the beginning and 419.5 MB in the end (delta: -162.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:17,588 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 297.8 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:12:17,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.44 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-25 00:12:17,588 INFO L168 Benchmark]: Boogie Preprocessor took 35.66 ms. Allocated memory is still 297.8 MB. Free memory was 244.5 MB in the beginning and 242.5 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:12:17,589 INFO L168 Benchmark]: RCFGBuilder took 221.71 ms. Allocated memory is still 297.8 MB. Free memory was 242.5 MB in the beginning and 228.6 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:12:17,589 INFO L168 Benchmark]: TraceAbstraction took 1941.03 ms. Allocated memory was 297.8 MB in the beginning and 467.7 MB in the end (delta: 169.9 MB). Free memory was 228.6 MB in the beginning and 419.5 MB in the end (delta: -191.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:12:17,591 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.19 ms. Allocated memory is still 297.8 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.44 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.66 ms. Allocated memory is still 297.8 MB. Free memory was 244.5 MB in the beginning and 242.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 221.71 ms. Allocated memory is still 297.8 MB. Free memory was 242.5 MB in the beginning and 228.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1941.03 ms. Allocated memory was 297.8 MB in the beginning and 467.7 MB in the end (delta: 169.9 MB). Free memory was 228.6 MB in the beginning and 419.5 MB in the end (delta: -191.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 3 error locations. SAFE Result, 1.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 28 SDslu, 739 SDs, 0 SdLazy, 334 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 17 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 10584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-12-17-600.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-12-17-600.csv Received shutdown request...