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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-1cceb4a
[2018-01-30 00:20:13,482 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-01-30 00:20:13,484 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-30 00:20:13,498 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-30 00:20:13,498 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-30 00:20:13,499 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-30 00:20:13,500 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-30 00:20:13,501 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-30 00:20:13,502 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-30 00:20:13,503 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-30 00:20:13,504 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-30 00:20:13,504 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-30 00:20:13,504 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-30 00:20:13,505 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-30 00:20:13,506 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-30 00:20:13,508 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-30 00:20:13,510 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-30 00:20:13,512 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-30 00:20:13,513 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-30 00:20:13,515 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-30 00:20:13,517 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-30 00:20:13,517 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-30 00:20:13,518 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-30 00:20:13,519 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-30 00:20:13,519 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-30 00:20:13,521 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-30 00:20:13,521 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-30 00:20:13,522 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-30 00:20:13,522 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-30 00:20:13,522 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-30 00:20:13,523 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-01-30 00:20:13,523 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-30 00:20:13,533 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-01-30 00:20:13,533 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-30 00:20:13,534 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-30 00:20:13,534 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-01-30 00:20:13,534 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-30 00:20:13,535 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-30 00:20:13,535 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-01-30 00:20:13,535 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-30 00:20:13,536 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-01-30 00:20:13,536 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-01-30 00:20:13,536 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-01-30 00:20:13,536 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-01-30 00:20:13,536 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-01-30 00:20:13,537 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-01-30 00:20:13,537 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-01-30 00:20:13,537 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-01-30 00:20:13,537 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-30 00:20:13,537 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-01-30 00:20:13,537 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-30 00:20:13,538 INFO  L133        SettingsManager]:  * Size of a code block=SingleStatement
[2018-01-30 00:20:13,538 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-01-30 00:20:13,538 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-01-30 00:20:13,538 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-01-30 00:20:13,538 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-30 00:20:13,538 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-30 00:20:13,539 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-01-30 00:20:13,539 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-01-30 00:20:13,539 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-30 00:20:13,539 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-01-30 00:20:13,539 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-30 00:20:13,540 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-30 00:20:13,540 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-30 00:20:13,540 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-30 00:20:13,541 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-01-30 00:20:13,575 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-30 00:20:13,589 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-30 00:20:13,594 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-30 00:20:13,595 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-01-30 00:20:13,596 INFO  L276        PluginConnector]: CDTParser initialized
[2018-01-30 00:20:13,597 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i
[2018-01-30 00:20:13,797 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-30 00:20:13,804 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-30 00:20:13,805 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-30 00:20:13,805 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-30 00:20:13,812 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-30 00:20:13,813 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:13" (1/1) ...
[2018-01-30 00:20:13,817 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46375823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:13, skipping insertion in model container
[2018-01-30 00:20:13,817 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:13" (1/1) ...
[2018-01-30 00:20:13,836 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-30 00:20:13,888 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-30 00:20:13,989 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-30 00:20:14,001 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-30 00:20:14,007 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14 WrapperNode
[2018-01-30 00:20:14,008 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-30 00:20:14,008 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-30 00:20:14,009 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-30 00:20:14,009 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-01-30 00:20:14,026 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,026 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,038 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,038 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,042 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,043 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,044 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (1/1) ...
[2018-01-30 00:20:14,045 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-30 00:20:14,046 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-30 00:20:14,046 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-01-30 00:20:14,046 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-01-30 00:20:14,046 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (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-30 00:20:14,090 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-30 00:20:14,090 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-30 00:20:14,090 INFO  L136     BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-01-30 00:20:14,090 INFO  L136     BoogieDeclarations]: Found implementation of procedure h5
[2018-01-30 00:20:14,090 INFO  L136     BoogieDeclarations]: Found implementation of procedure g5
[2018-01-30 00:20:14,091 INFO  L136     BoogieDeclarations]: Found implementation of procedure entry_point
[2018-01-30 00:20:14,091 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure malloc
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure free
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-01-30 00:20:14,091 INFO  L128     BoogieDeclarations]: Found specification of procedure h5
[2018-01-30 00:20:14,092 INFO  L128     BoogieDeclarations]: Found specification of procedure g5
[2018-01-30 00:20:14,092 INFO  L128     BoogieDeclarations]: Found specification of procedure entry_point
[2018-01-30 00:20:14,092 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-01-30 00:20:14,092 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-30 00:20:14,092 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-30 00:20:14,246 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-30 00:20:14,246 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:14 BoogieIcfgContainer
[2018-01-30 00:20:14,246 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-30 00:20:14,247 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-30 00:20:14,247 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-01-30 00:20:14,249 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-01-30 00:20:14,250 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:20:13" (1/3) ...
[2018-01-30 00:20:14,250 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cea4720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:14, skipping insertion in model container
[2018-01-30 00:20:14,250 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:14" (2/3) ...
[2018-01-30 00:20:14,251 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cea4720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:14, skipping insertion in model container
[2018-01-30 00:20:14,251 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:14" (3/3) ...
[2018-01-30 00:20:14,253 INFO  L107   eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i
[2018-01-30 00:20:14,260 INFO  L128   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-30 00:20:14,265 INFO  L140   ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations.
[2018-01-30 00:20:14,316 INFO  L322      AbstractCegarLoop]: Interprodecural is true
[2018-01-30 00:20:14,316 INFO  L323      AbstractCegarLoop]: Hoare is true
[2018-01-30 00:20:14,316 INFO  L324      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-30 00:20:14,316 INFO  L325      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-30 00:20:14,316 INFO  L326      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-30 00:20:14,317 INFO  L327      AbstractCegarLoop]: Difference is false
[2018-01-30 00:20:14,317 INFO  L328      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-30 00:20:14,317 INFO  L333      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-30 00:20:14,318 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-30 00:20:14,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states.
[2018-01-30 00:20:14,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-30 00:20:14,344 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:14,345 INFO  L350         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]
[2018-01-30 00:20:14,345 INFO  L371      AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:14,350 INFO  L82        PathProgramCache]: Analyzing trace with hash -1778176818, now seen corresponding path program 1 times
[2018-01-30 00:20:14,352 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:14,353 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:14,412 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:14,413 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:14,413 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:14,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:14,474 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:14,711 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-30 00:20:14,714 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:14,715 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-30 00:20:14,717 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-30 00:20:14,727 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-30 00:20:14,727 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2018-01-30 00:20:14,730 INFO  L87              Difference]: Start difference. First operand 41 states. Second operand 10 states.
[2018-01-30 00:20:14,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:14,985 INFO  L93              Difference]: Finished difference Result 60 states and 62 transitions.
[2018-01-30 00:20:14,986 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-01-30 00:20:14,987 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 27
[2018-01-30 00:20:14,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:15,002 INFO  L225             Difference]: With dead ends: 60
[2018-01-30 00:20:15,003 INFO  L226             Difference]: Without dead ends: 56
[2018-01-30 00:20:15,005 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-01-30 00:20:15,019 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-01-30 00:20:15,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53.
[2018-01-30 00:20:15,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-01-30 00:20:15,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions.
[2018-01-30 00:20:15,040 INFO  L78                 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 27
[2018-01-30 00:20:15,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:15,041 INFO  L432      AbstractCegarLoop]: Abstraction has 53 states and 56 transitions.
[2018-01-30 00:20:15,041 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-30 00:20:15,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions.
[2018-01-30 00:20:15,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-30 00:20:15,042 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:15,042 INFO  L350         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]
[2018-01-30 00:20:15,042 INFO  L371      AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:15,042 INFO  L82        PathProgramCache]: Analyzing trace with hash -1778176817, now seen corresponding path program 1 times
[2018-01-30 00:20:15,042 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:15,042 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:15,044 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,044 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:15,044 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:15,064 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:15,169 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-30 00:20:15,169 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:15,170 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-30 00:20:15,172 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-30 00:20:15,172 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-30 00:20:15,172 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2018-01-30 00:20:15,173 INFO  L87              Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 10 states.
[2018-01-30 00:20:15,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:15,331 INFO  L93              Difference]: Finished difference Result 58 states and 60 transitions.
[2018-01-30 00:20:15,331 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-01-30 00:20:15,331 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 27
[2018-01-30 00:20:15,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:15,333 INFO  L225             Difference]: With dead ends: 58
[2018-01-30 00:20:15,333 INFO  L226             Difference]: Without dead ends: 57
[2018-01-30 00:20:15,335 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-01-30 00:20:15,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-01-30 00:20:15,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53.
[2018-01-30 00:20:15,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-01-30 00:20:15,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions.
[2018-01-30 00:20:15,344 INFO  L78                 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 27
[2018-01-30 00:20:15,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:15,345 INFO  L432      AbstractCegarLoop]: Abstraction has 53 states and 55 transitions.
[2018-01-30 00:20:15,345 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-30 00:20:15,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2018-01-30 00:20:15,346 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-01-30 00:20:15,346 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:15,347 INFO  L350         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:20:15,347 INFO  L371      AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:15,347 INFO  L82        PathProgramCache]: Analyzing trace with hash 1770482790, now seen corresponding path program 1 times
[2018-01-30 00:20:15,347 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:15,347 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:15,349 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,349 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:15,349 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:15,369 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:15,489 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-30 00:20:15,489 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:15,490 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-01-30 00:20:15,490 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-30 00:20:15,490 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-30 00:20:15,490 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2018-01-30 00:20:15,491 INFO  L87              Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 11 states.
[2018-01-30 00:20:15,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:15,668 INFO  L93              Difference]: Finished difference Result 53 states and 55 transitions.
[2018-01-30 00:20:15,669 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-01-30 00:20:15,669 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 28
[2018-01-30 00:20:15,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:15,671 INFO  L225             Difference]: With dead ends: 53
[2018-01-30 00:20:15,671 INFO  L226             Difference]: Without dead ends: 52
[2018-01-30 00:20:15,671 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-01-30 00:20:15,672 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-01-30 00:20:15,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-01-30 00:20:15,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-30 00:20:15,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions.
[2018-01-30 00:20:15,679 INFO  L78                 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28
[2018-01-30 00:20:15,679 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:15,679 INFO  L432      AbstractCegarLoop]: Abstraction has 52 states and 54 transitions.
[2018-01-30 00:20:15,679 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-30 00:20:15,679 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions.
[2018-01-30 00:20:15,680 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-01-30 00:20:15,680 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:15,680 INFO  L350         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-30 00:20:15,680 INFO  L371      AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:15,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 1770482791, now seen corresponding path program 1 times
[2018-01-30 00:20:15,680 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:15,681 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:15,682 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,682 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:15,682 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:15,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:15,697 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:15,808 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-30 00:20:15,809 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:15,809 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-01-30 00:20:15,809 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-30 00:20:15,809 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-30 00:20:15,810 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2018-01-30 00:20:15,810 INFO  L87              Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 11 states.
[2018-01-30 00:20:16,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:16,084 INFO  L93              Difference]: Finished difference Result 56 states and 58 transitions.
[2018-01-30 00:20:16,085 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-01-30 00:20:16,085 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 28
[2018-01-30 00:20:16,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:16,086 INFO  L225             Difference]: With dead ends: 56
[2018-01-30 00:20:16,087 INFO  L226             Difference]: Without dead ends: 55
[2018-01-30 00:20:16,087 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-01-30 00:20:16,088 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2018-01-30 00:20:16,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36.
[2018-01-30 00:20:16,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-01-30 00:20:16,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions.
[2018-01-30 00:20:16,099 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 28
[2018-01-30 00:20:16,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:16,099 INFO  L432      AbstractCegarLoop]: Abstraction has 36 states and 37 transitions.
[2018-01-30 00:20:16,100 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-30 00:20:16,100 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions.
[2018-01-30 00:20:16,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-30 00:20:16,101 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:16,101 INFO  L350         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]
[2018-01-30 00:20:16,101 INFO  L371      AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:16,102 INFO  L82        PathProgramCache]: Analyzing trace with hash 1556839737, now seen corresponding path program 1 times
[2018-01-30 00:20:16,102 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:16,102 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:16,103 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,103 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:16,103 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:16,116 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:16,150 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-30 00:20:16,151 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:16,151 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-30 00:20:16,151 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-30 00:20:16,152 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-30 00:20:16,152 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-30 00:20:16,152 INFO  L87              Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 3 states.
[2018-01-30 00:20:16,198 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:16,198 INFO  L93              Difference]: Finished difference Result 52 states and 54 transitions.
[2018-01-30 00:20:16,198 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-01-30 00:20:16,198 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 31
[2018-01-30 00:20:16,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:16,201 INFO  L225             Difference]: With dead ends: 52
[2018-01-30 00:20:16,201 INFO  L226             Difference]: Without dead ends: 48
[2018-01-30 00:20:16,201 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-30 00:20:16,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-01-30 00:20:16,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-01-30 00:20:16,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-01-30 00:20:16,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2018-01-30 00:20:16,214 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 31
[2018-01-30 00:20:16,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:16,214 INFO  L432      AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2018-01-30 00:20:16,214 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-30 00:20:16,214 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2018-01-30 00:20:16,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-30 00:20:16,216 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:16,216 INFO  L350         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-30 00:20:16,216 INFO  L371      AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:16,216 INFO  L82        PathProgramCache]: Analyzing trace with hash 1316368593, now seen corresponding path program 1 times
[2018-01-30 00:20:16,217 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:16,217 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:16,218 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,218 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:16,218 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:16,228 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:16,346 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-30 00:20:16,346 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:16,346 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-30 00:20:16,346 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-30 00:20:16,346 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-30 00:20:16,347 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2018-01-30 00:20:16,347 INFO  L87              Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states.
[2018-01-30 00:20:16,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:16,481 INFO  L93              Difference]: Finished difference Result 54 states and 55 transitions.
[2018-01-30 00:20:16,481 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-01-30 00:20:16,481 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 32
[2018-01-30 00:20:16,482 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:16,482 INFO  L225             Difference]: With dead ends: 54
[2018-01-30 00:20:16,482 INFO  L226             Difference]: Without dead ends: 48
[2018-01-30 00:20:16,483 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-01-30 00:20:16,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-01-30 00:20:16,488 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36.
[2018-01-30 00:20:16,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-01-30 00:20:16,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions.
[2018-01-30 00:20:16,489 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32
[2018-01-30 00:20:16,489 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:16,489 INFO  L432      AbstractCegarLoop]: Abstraction has 36 states and 36 transitions.
[2018-01-30 00:20:16,489 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-30 00:20:16,490 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions.
[2018-01-30 00:20:16,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-30 00:20:16,490 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:16,491 INFO  L350         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-30 00:20:16,491 INFO  L371      AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:16,491 INFO  L82        PathProgramCache]: Analyzing trace with hash 671099184, now seen corresponding path program 1 times
[2018-01-30 00:20:16,491 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:16,491 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:16,493 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,493 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:16,493 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:16,503 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:16,629 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-30 00:20:16,629 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:16,630 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-30 00:20:16,630 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-30 00:20:16,630 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-30 00:20:16,630 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-01-30 00:20:16,631 INFO  L87              Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states.
[2018-01-30 00:20:16,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:16,717 INFO  L93              Difference]: Finished difference Result 50 states and 50 transitions.
[2018-01-30 00:20:16,717 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-01-30 00:20:16,717 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 32
[2018-01-30 00:20:16,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:16,718 INFO  L225             Difference]: With dead ends: 50
[2018-01-30 00:20:16,718 INFO  L226             Difference]: Without dead ends: 34
[2018-01-30 00:20:16,718 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2018-01-30 00:20:16,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-01-30 00:20:16,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2018-01-30 00:20:16,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-01-30 00:20:16,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions.
[2018-01-30 00:20:16,723 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 32
[2018-01-30 00:20:16,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:16,723 INFO  L432      AbstractCegarLoop]: Abstraction has 34 states and 33 transitions.
[2018-01-30 00:20:16,723 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-30 00:20:16,723 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions.
[2018-01-30 00:20:16,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-01-30 00:20:16,724 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-30 00:20:16,724 INFO  L350         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]
[2018-01-30 00:20:16,724 INFO  L371      AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]===
[2018-01-30 00:20:16,724 INFO  L82        PathProgramCache]: Analyzing trace with hash 1806428312, now seen corresponding path program 1 times
[2018-01-30 00:20:16,724 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-30 00:20:16,724 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-30 00:20:16,725 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,726 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-30 00:20:16,726 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-30 00:20:16,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-30 00:20:16,737 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-30 00:20:16,958 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-30 00:20:16,959 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-30 00:20:16,959 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-30 00:20:16,959 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-30 00:20:16,959 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-30 00:20:16,959 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2018-01-30 00:20:16,960 INFO  L87              Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 12 states.
[2018-01-30 00:20:17,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-30 00:20:17,180 INFO  L93              Difference]: Finished difference Result 34 states and 33 transitions.
[2018-01-30 00:20:17,180 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2018-01-30 00:20:17,180 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 33
[2018-01-30 00:20:17,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-30 00:20:17,181 INFO  L225             Difference]: With dead ends: 34
[2018-01-30 00:20:17,181 INFO  L226             Difference]: Without dead ends: 0
[2018-01-30 00:20:17,181 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342
[2018-01-30 00:20:17,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-30 00:20:17,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-30 00:20:17,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-30 00:20:17,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-30 00:20:17,182 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33
[2018-01-30 00:20:17,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-30 00:20:17,182 INFO  L432      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-30 00:20:17,182 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-30 00:20:17,182 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-30 00:20:17,182 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-30 00:20:17,187 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-30 00:20:17,270 INFO  L395   ceAbstractionStarter]: At program point  ldv_mallocENTRY(lines 1072 1078)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1073(line 1073)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1073''(line 1073)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1073'''(line 1073)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1074'(line 1074)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  ldv_mallocEXIT(lines 1072 1078)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1073'(lines 1073 1077)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  ldv_mallocFINAL(lines 1072 1078)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1074(line 1074)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1076(line 1076)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  L1(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,271 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L395   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(lines 1 1451)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initFINAL(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L402   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(lines 1 1451)  the Hoare annotation is:  true
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L402   ceAbstractionStarter]: At program point  L1(lines 1 1451)  the Hoare annotation is:  true
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L395   ceAbstractionStarter]: At program point  mainENTRY(lines 1449 1451)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  mainFINAL(lines 1449 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  mainEXIT(lines 1449 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  mainErr0EnsuresViolation(lines 1449 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  L1434(line 1434)  no Hoare annotation was computed.
[2018-01-30 00:20:17,272 INFO  L399   ceAbstractionStarter]: For program point  L1435(line 1435)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  h5EXIT(lines 1433 1436)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L395   ceAbstractionStarter]: At program point  h5ENTRY(lines 1433 1436)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  L1434'(line 1434)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  h5FINAL(lines 1433 1436)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L395   ceAbstractionStarter]: At program point  entry_pointENTRY(lines 1444 1447)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  entry_pointFINAL(lines 1444 1447)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  L1445(line 1445)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L395   ceAbstractionStarter]: At program point  L1446(line 1446)  the Hoare annotation is:  (let ((.cse2 (select |#valid| entry_point_~p~10.base)) (.cse0 (= 0 entry_point_~p~10.base))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (= 0 entry_point_~p~10.offset))) (or (and (= 1 .cse2) .cse4) (and .cse0 .cse4))))) (or (and (not .cse0) .cse3) (and (= |#valid| |old(#valid)|) .cse3))))) (or (and .cse0 .cse1) (and (= (store |old(#valid)| entry_point_~p~10.base .cse2) |#valid|) .cse1 (= (select |old(#valid)| entry_point_~p~10.base) 0)))))
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  entry_pointEXIT(lines 1444 1447)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  L1445'(line 1445)  no Hoare annotation was computed.
[2018-01-30 00:20:17,273 INFO  L399   ceAbstractionStarter]: For program point  g5Err1RequiresViolation(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,274 INFO  L399   ceAbstractionStarter]: For program point  g5EXIT(lines 1438 1442)  no Hoare annotation was computed.
[2018-01-30 00:20:17,274 INFO  L399   ceAbstractionStarter]: For program point  L1439(lines 1439 1441)  no Hoare annotation was computed.
[2018-01-30 00:20:17,274 INFO  L399   ceAbstractionStarter]: For program point  g5Err0RequiresViolation(lines 1 1451)  no Hoare annotation was computed.
[2018-01-30 00:20:17,274 INFO  L395   ceAbstractionStarter]: At program point  g5ENTRY(lines 1438 1442)  the Hoare annotation is:  (or (let ((.cse0 (not (= 0 |g5_#in~p.offset|)))) (and (or .cse0 (not (= (select |old(#valid)| |g5_#in~p.base|) 1))) (or .cse0 (not (= 0 |g5_#in~p.base|))))) (= |#valid| |old(#valid)|))
[2018-01-30 00:20:17,274 INFO  L399   ceAbstractionStarter]: For program point  L1439'(lines 1439 1441)  no Hoare annotation was computed.
[2018-01-30 00:20:17,274 INFO  L399   ceAbstractionStarter]: For program point  L1440(line 1440)  no Hoare annotation was computed.
[2018-01-30 00:20:17,277 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:20:17 BoogieIcfgContainer
[2018-01-30 00:20:17,278 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-30 00:20:17,279 INFO  L168              Benchmark]: Toolchain (without parser) took 3481.36 ms. Allocated memory was 308.3 MB in the beginning and 518.0 MB in the end (delta: 209.7 MB). Free memory was 267.2 MB in the beginning and 446.5 MB in the end (delta: -179.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,280 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,280 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 203.02 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 254.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,280 INFO  L168              Benchmark]: Boogie Preprocessor took 36.85 ms. Allocated memory is still 308.3 MB. Free memory was 254.2 MB in the beginning and 253.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,281 INFO  L168              Benchmark]: RCFGBuilder took 200.89 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 237.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,281 INFO  L168              Benchmark]: TraceAbstraction took 3030.78 ms. Allocated memory was 308.3 MB in the beginning and 518.0 MB in the end (delta: 209.7 MB). Free memory was 237.8 MB in the beginning and 446.5 MB in the end (delta: -208.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB.
[2018-01-30 00:20:17,283 INFO  L344   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 203.02 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 254.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 36.85 ms. Allocated memory is still 308.3 MB. Free memory was 254.2 MB in the beginning and 253.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB.
 * RCFGBuilder took 200.89 ms. Allocated memory is still 308.3 MB. Free memory was 253.2 MB in the beginning and 237.8 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 3030.78 ms. Allocated memory was 308.3 MB in the beginning and 518.0 MB in the end (delta: 209.7 MB). Free memory was 237.8 MB in the beginning and 446.5 MB in the end (delta: -208.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 1449]: 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 7 procedures, 41 locations, 3 error locations. SAFE Result, 2.9s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 266 SDtfs, 96 SDslu, 1818 SDs, 0 SdLazy, 720 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 10 PreInvPairs, 11 NumberOfFragments, 149 HoareAnnotationTreeSize, 10 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 24563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-20-17-291.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-20-17-291.csv
Received shutdown request...