/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c


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


This is Ultimate 0.1.25-3af5e1f
[2020-09-04 13:45:23,199 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-09-04 13:45:23,202 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-09-04 13:45:23,229 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-09-04 13:45:23,230 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-09-04 13:45:23,231 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-09-04 13:45:23,232 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-09-04 13:45:23,234 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-09-04 13:45:23,236 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-09-04 13:45:23,237 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-09-04 13:45:23,238 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-09-04 13:45:23,239 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-09-04 13:45:23,239 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-09-04 13:45:23,240 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-09-04 13:45:23,242 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-09-04 13:45:23,243 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-09-04 13:45:23,244 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-09-04 13:45:23,245 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-09-04 13:45:23,247 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-09-04 13:45:23,250 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-09-04 13:45:23,251 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-09-04 13:45:23,253 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-09-04 13:45:23,254 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-09-04 13:45:23,255 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-09-04 13:45:23,258 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-09-04 13:45:23,258 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-09-04 13:45:23,259 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-09-04 13:45:23,260 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-09-04 13:45:23,260 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-09-04 13:45:23,261 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-09-04 13:45:23,262 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-09-04 13:45:23,263 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-09-04 13:45:23,264 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-09-04 13:45:23,270 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-09-04 13:45:23,275 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-09-04 13:45:23,275 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-09-04 13:45:23,276 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-09-04 13:45:23,276 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-09-04 13:45:23,277 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-09-04 13:45:23,278 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-09-04 13:45:23,279 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-09-04 13:45:23,279 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-09-04 13:45:23,306 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-09-04 13:45:23,306 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-09-04 13:45:23,308 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-09-04 13:45:23,308 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-09-04 13:45:23,308 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-09-04 13:45:23,308 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-09-04 13:45:23,309 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-09-04 13:45:23,309 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-09-04 13:45:23,309 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-09-04 13:45:23,309 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-09-04 13:45:23,309 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-09-04 13:45:23,310 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-09-04 13:45:23,310 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-09-04 13:45:23,310 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-09-04 13:45:23,310 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-09-04 13:45:23,310 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-09-04 13:45:23,311 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-09-04 13:45:23,311 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-09-04 13:45:23,311 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-09-04 13:45:23,311 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-09-04 13:45:23,311 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-09-04 13:45:23,312 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-09-04 13:45:23,312 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-09-04 13:45:23,312 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-09-04 13:45:23,312 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-09-04 13:45:23,313 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-09-04 13:45:23,313 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-09-04 13:45:23,313 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-09-04 13:45:23,313 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-09-04 13:45:23,313 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-09-04 13:45:23,797 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-09-04 13:45:23,817 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-09-04 13:45:23,821 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-09-04 13:45:23,823 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-09-04 13:45:23,824 INFO  L275        PluginConnector]: CDTParser initialized
[2020-09-04 13:45:23,825 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c
[2020-09-04 13:45:23,921 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9b9a35769/769e360269804bf09e8de406b5d01f6b/FLAG3a12beac2
[2020-09-04 13:45:24,526 INFO  L306              CDTParser]: Found 1 translation units.
[2020-09-04 13:45:24,527 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/tree_del_iter.c
[2020-09-04 13:45:24,537 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9b9a35769/769e360269804bf09e8de406b5d01f6b/FLAG3a12beac2
[2020-09-04 13:45:24,800 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9b9a35769/769e360269804bf09e8de406b5d01f6b
[2020-09-04 13:45:24,814 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-09-04 13:45:24,816 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-09-04 13:45:24,819 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-09-04 13:45:24,819 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-09-04 13:45:24,823 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-09-04 13:45:24,824 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:45:24" (1/1) ...
[2020-09-04 13:45:24,829 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dc0cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:24, skipping insertion in model container
[2020-09-04 13:45:24,830 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:45:24" (1/1) ...
[2020-09-04 13:45:24,841 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-09-04 13:45:24,872 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-09-04 13:45:25,112 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:45:25,129 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-09-04 13:45:25,147 INFO  L203         MainTranslator]: Completed pre-run
[2020-09-04 13:45:25,172 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:45:25,184 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-09-04 13:45:25,300 INFO  L208         MainTranslator]: Completed translation
[2020-09-04 13:45:25,301 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25 WrapperNode
[2020-09-04 13:45:25,301 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-09-04 13:45:25,303 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-09-04 13:45:25,303 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-09-04 13:45:25,304 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-09-04 13:45:25,322 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,323 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,337 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,338 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,357 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,365 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,368 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
[2020-09-04 13:45:25,373 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-09-04 13:45:25,374 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-09-04 13:45:25,375 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-09-04 13:45:25,375 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-09-04 13:45:25,377 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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
[2020-09-04 13:45:25,455 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-09-04 13:45:25,455 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-09-04 13:45:25,455 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not
[2020-09-04 13:45:25,455 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-09-04 13:45:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2020-09-04 13:45:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2020-09-04 13:45:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_del
[2020-09-04 13:45:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2020-09-04 13:45:25,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2020-09-04 13:45:25,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure task
[2020-09-04 13:45:25,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-09-04 13:45:25,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2020-09-04 13:45:25,457 INFO  L130     BoogieDeclarations]: Found specification of procedure calloc
[2020-09-04 13:45:25,457 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-09-04 13:45:25,458 INFO  L130     BoogieDeclarations]: Found specification of procedure free
[2020-09-04 13:45:25,458 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-09-04 13:45:25,458 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2020-09-04 13:45:25,458 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_cycle_if_not
[2020-09-04 13:45:25,458 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-09-04 13:45:25,459 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2020-09-04 13:45:25,460 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-09-04 13:45:25,460 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-09-04 13:45:25,460 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_del
[2020-09-04 13:45:25,460 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-09-04 13:45:25,460 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure task
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-09-04 13:45:25,461 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-09-04 13:45:25,462 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-09-04 13:45:26,088 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-09-04 13:45:26,088 INFO  L295             CfgBuilder]: Removed 3 assume(true) statements.
[2020-09-04 13:45:26,099 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:45:26 BoogieIcfgContainer
[2020-09-04 13:45:26,099 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-09-04 13:45:26,101 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-09-04 13:45:26,101 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-09-04 13:45:26,107 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-09-04 13:45:26,108 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:45:24" (1/3) ...
[2020-09-04 13:45:26,109 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f60f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:45:26, skipping insertion in model container
[2020-09-04 13:45:26,109 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:45:25" (2/3) ...
[2020-09-04 13:45:26,110 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f60f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:45:26, skipping insertion in model container
[2020-09-04 13:45:26,110 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:45:26" (3/3) ...
[2020-09-04 13:45:26,114 INFO  L109   eAbstractionObserver]: Analyzing ICFG tree_del_iter.c
[2020-09-04 13:45:26,127 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-09-04 13:45:26,139 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-09-04 13:45:26,162 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-09-04 13:45:26,191 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-09-04 13:45:26,192 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-09-04 13:45:26,192 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-09-04 13:45:26,192 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-09-04 13:45:26,192 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-09-04 13:45:26,192 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-09-04 13:45:26,192 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-09-04 13:45:26,192 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-09-04 13:45:26,217 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states.
[2020-09-04 13:45:26,228 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2020-09-04 13:45:26,228 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:45:26,230 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-04 13:45:26,230 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:45:26,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:45:26,237 INFO  L82        PathProgramCache]: Analyzing trace with hash 806421993, now seen corresponding path program 1 times
[2020-09-04 13:45:26,251 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:45:26,252 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279098970]
[2020-09-04 13:45:26,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:45:26,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,575 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:45:26,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,611 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:45:26,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,629 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-09-04 13:45:26,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,641 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-09-04 13:45:26,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,688 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2020-09-04 13:45:26,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,742 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-09-04 13:45:26,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,770 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2020-09-04 13:45:26,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:26,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-04 13:45:26,792 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279098970]
[2020-09-04 13:45:26,794 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:45:26,794 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-09-04 13:45:26,795 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871974329]
[2020-09-04 13:45:26,802 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-09-04 13:45:26,802 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:45:26,820 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-09-04 13:45:26,822 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-09-04 13:45:26,825 INFO  L87              Difference]: Start difference. First operand 98 states. Second operand 11 states.
[2020-09-04 13:45:27,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:45:27,815 INFO  L93              Difference]: Finished difference Result 174 states and 235 transitions.
[2020-09-04 13:45:27,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-09-04 13:45:27,818 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 44
[2020-09-04 13:45:27,819 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:45:27,845 INFO  L225             Difference]: With dead ends: 174
[2020-09-04 13:45:27,846 INFO  L226             Difference]: Without dead ends: 98
[2020-09-04 13:45:27,855 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2020-09-04 13:45:27,879 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2020-09-04 13:45:27,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91.
[2020-09-04 13:45:27,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2020-09-04 13:45:27,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions.
[2020-09-04 13:45:27,952 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44
[2020-09-04 13:45:27,953 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:45:27,953 INFO  L479      AbstractCegarLoop]: Abstraction has 91 states and 115 transitions.
[2020-09-04 13:45:27,953 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-09-04 13:45:27,953 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions.
[2020-09-04 13:45:27,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2020-09-04 13:45:27,957 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:45:27,958 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-04 13:45:27,958 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-09-04 13:45:27,958 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:45:27,959 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:45:27,959 INFO  L82        PathProgramCache]: Analyzing trace with hash -1561052270, now seen corresponding path program 1 times
[2020-09-04 13:45:27,959 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:45:27,960 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541676711]
[2020-09-04 13:45:27,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:45:27,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,086 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:45:28,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,126 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:45:28,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,161 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-09-04 13:45:28,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,169 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-09-04 13:45:28,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,222 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:45:28,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,229 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:45:28,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,236 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2020-09-04 13:45:28,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,254 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2020-09-04 13:45:28,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,285 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2020-09-04 13:45:28,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-09-04 13:45:28,300 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541676711]
[2020-09-04 13:45:28,300 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697164382]
[2020-09-04 13:45:28,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-09-04 13:45:28,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:28,401 INFO  L263         TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core
[2020-09-04 13:45:28,411 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-09-04 13:45:28,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-09-04 13:45:28,500 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-09-04 13:45:28,501 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 12
[2020-09-04 13:45:28,502 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849353891]
[2020-09-04 13:45:28,503 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-09-04 13:45:28,504 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:45:28,504 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-09-04 13:45:28,504 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2020-09-04 13:45:28,505 INFO  L87              Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 12 states.
[2020-09-04 13:45:29,434 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:45:29,434 INFO  L93              Difference]: Finished difference Result 165 states and 211 transitions.
[2020-09-04 13:45:29,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-09-04 13:45:29,435 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 56
[2020-09-04 13:45:29,435 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:45:29,441 INFO  L225             Difference]: With dead ends: 165
[2020-09-04 13:45:29,441 INFO  L226             Difference]: Without dead ends: 97
[2020-09-04 13:45:29,444 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380
[2020-09-04 13:45:29,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2020-09-04 13:45:29,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93.
[2020-09-04 13:45:29,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-09-04 13:45:29,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions.
[2020-09-04 13:45:29,468 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56
[2020-09-04 13:45:29,468 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:45:29,469 INFO  L479      AbstractCegarLoop]: Abstraction has 93 states and 118 transitions.
[2020-09-04 13:45:29,469 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-09-04 13:45:29,469 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions.
[2020-09-04 13:45:29,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-09-04 13:45:29,472 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:45:29,472 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-04 13:45:29,685 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2020-09-04 13:45:29,686 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:45:29,686 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:45:29,687 INFO  L82        PathProgramCache]: Analyzing trace with hash -217941329, now seen corresponding path program 1 times
[2020-09-04 13:45:29,687 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:45:29,688 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846894176]
[2020-09-04 13:45:29,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:45:29,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,795 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:45:29,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,819 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:45:29,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,882 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-09-04 13:45:29,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,890 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-09-04 13:45:29,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,899 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-04 13:45:29,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,949 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2020-09-04 13:45:29,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,965 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:45:29,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,969 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:45:29,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,972 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2020-09-04 13:45:29,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:29,992 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2020-09-04 13:45:29,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:30,019 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2020-09-04 13:45:30,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:30,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2020-09-04 13:45:30,031 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846894176]
[2020-09-04 13:45:30,032 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:45:30,032 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-09-04 13:45:30,033 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310314341]
[2020-09-04 13:45:30,033 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-09-04 13:45:30,034 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:45:30,034 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-09-04 13:45:30,035 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-09-04 13:45:30,035 INFO  L87              Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 13 states.
[2020-09-04 13:45:30,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:45:30,937 INFO  L93              Difference]: Finished difference Result 164 states and 210 transitions.
[2020-09-04 13:45:30,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-09-04 13:45:30,938 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 66
[2020-09-04 13:45:30,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:45:30,944 INFO  L225             Difference]: With dead ends: 164
[2020-09-04 13:45:30,944 INFO  L226             Difference]: Without dead ends: 99
[2020-09-04 13:45:30,948 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420
[2020-09-04 13:45:30,949 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2020-09-04 13:45:30,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95.
[2020-09-04 13:45:30,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2020-09-04 13:45:30,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions.
[2020-09-04 13:45:30,977 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66
[2020-09-04 13:45:30,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:45:30,977 INFO  L479      AbstractCegarLoop]: Abstraction has 95 states and 121 transitions.
[2020-09-04 13:45:30,977 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-09-04 13:45:30,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions.
[2020-09-04 13:45:30,980 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2020-09-04 13:45:30,980 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:45:30,981 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-04 13:45:30,981 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-09-04 13:45:30,981 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:45:30,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:45:30,982 INFO  L82        PathProgramCache]: Analyzing trace with hash -62868055, now seen corresponding path program 1 times
[2020-09-04 13:45:30,982 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:45:30,982 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301702416]
[2020-09-04 13:45:30,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:45:31,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,094 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:45:31,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,113 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:45:31,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,171 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-09-04 13:45:31,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,179 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-09-04 13:45:31,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,187 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-04 13:45:31,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,199 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:45:31,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,202 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:45:31,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,205 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2020-09-04 13:45:31,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,216 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:45:31,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,219 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:45:31,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,222 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2020-09-04 13:45:31,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,235 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2020-09-04 13:45:31,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,256 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2020-09-04 13:45:31,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:45:31,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2020-09-04 13:45:31,293 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301702416]
[2020-09-04 13:45:31,293 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:45:31,294 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-09-04 13:45:31,294 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156049965]
[2020-09-04 13:45:31,294 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-09-04 13:45:31,295 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:45:31,295 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-09-04 13:45:31,295 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-09-04 13:45:31,295 INFO  L87              Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 13 states.
[2020-09-04 13:45:32,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:45:32,103 INFO  L93              Difference]: Finished difference Result 152 states and 194 transitions.
[2020-09-04 13:45:32,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-09-04 13:45:32,104 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 79
[2020-09-04 13:45:32,104 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:45:32,106 INFO  L225             Difference]: With dead ends: 152
[2020-09-04 13:45:32,106 INFO  L226             Difference]: Without dead ends: 99
[2020-09-04 13:45:32,107 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462
[2020-09-04 13:45:32,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2020-09-04 13:45:32,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97.
[2020-09-04 13:45:32,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2020-09-04 13:45:32,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions.
[2020-09-04 13:45:32,122 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79
[2020-09-04 13:45:32,123 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:45:32,123 INFO  L479      AbstractCegarLoop]: Abstraction has 97 states and 125 transitions.
[2020-09-04 13:45:32,123 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-09-04 13:45:32,123 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions.
[2020-09-04 13:45:32,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-09-04 13:45:32,126 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:45:32,127 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-09-04 13:45:32,127 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-09-04 13:45:32,127 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:45:32,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:45:32,128 INFO  L82        PathProgramCache]: Analyzing trace with hash -708508396, now seen corresponding path program 1 times
[2020-09-04 13:45:32,128 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:45:32,128 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251812431]
[2020-09-04 13:45:32,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:45:32,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-09-04 13:45:32,194 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-09-04 13:45:32,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-09-04 13:45:32,269 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-09-04 13:45:32,330 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-09-04 13:45:32,330 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-09-04 13:45:32,330 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-09-04 13:45:32,445 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:45:32 BoogieIcfgContainer
[2020-09-04 13:45:32,445 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-09-04 13:45:32,450 INFO  L168              Benchmark]: Toolchain (without parser) took 7631.21 ms. Allocated memory was 138.9 MB in the beginning and 287.3 MB in the end (delta: 148.4 MB). Free memory was 100.3 MB in the beginning and 199.7 MB in the end (delta: -99.4 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,452 INFO  L168              Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 118.8 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,460 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 482.94 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 179.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,462 INFO  L168              Benchmark]: Boogie Preprocessor took 70.67 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 177.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,463 INFO  L168              Benchmark]: RCFGBuilder took 725.40 ms. Allocated memory is still 202.9 MB. Free memory was 177.8 MB in the beginning and 141.5 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,464 INFO  L168              Benchmark]: TraceAbstraction took 6344.13 ms. Allocated memory was 202.9 MB in the beginning and 287.3 MB in the end (delta: 84.4 MB). Free memory was 141.5 MB in the beginning and 199.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB.
[2020-09-04 13:45:32,476 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 118.8 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 482.94 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 179.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 70.67 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 177.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 725.40 ms. Allocated memory is still 202.9 MB. Free memory was 177.8 MB in the beginning and 141.5 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 6344.13 ms. Allocated memory was 202.9 MB in the beginning and 287.3 MB in the end (delta: 84.4 MB). Free memory was 141.5 MB in the beginning and 199.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L108]  CALL, EXPR   nondet_tree()
[L23]   COND FALSE   !(__VERIFIER_nondet_bool())
[L26]                struct node *n = (struct node *)malloc(sizeof(struct node));
[L27]                n->data = __VERIFIER_nondet_int()
[L28]   CALL, EXPR   nondet_tree()
[L23]   COND TRUE    __VERIFIER_nondet_bool()
[L24]                return 0;
        VAL          [\result={0:0}]
[L28]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L28]                n->left = nondet_tree()
[L29]   CALL, EXPR   nondet_tree()
[L23]   COND TRUE    __VERIFIER_nondet_bool()
[L24]                return 0;
        VAL          [\result={0:0}]
[L29]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L29]                n->right = nondet_tree()
[L30]                return n;
        VAL          [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}]
[L108]  RET, EXPR    nondet_tree()
        VAL          [nondet_tree()={-1:0}]
[L108]  CALL         task(nondet_tree())
        VAL          [t={-1:0}]
[L84]   CALL, EXPR   min(t)
        VAL          [n={-1:0}]
[L35]   COND FALSE   !(!n)
[L38]   EXPR         n->data
[L38]                int a = n->data;
[L39]   EXPR         n->left
        VAL          [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L39]   CALL, EXPR   min(n->left)
        VAL          [n={0:0}]
[L35]   COND TRUE    !n
[L36]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L39]   RET, EXPR    min(n->left)
        VAL          [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L39]                int b = min(n->left);
[L40]   EXPR         n->right
        VAL          [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L40]   CALL, EXPR   min(n->right)
        VAL          [n={0:0}]
[L35]   COND TRUE    !n
[L36]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L40]   RET, EXPR    min(n->right)
        VAL          [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L40]                int c = min(n->right);
[L41]   COND TRUE    b <= a && b <= c
[L41]                return b;
        VAL          [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}]
[L84]   RET, EXPR    min(t)
        VAL          [min(t)=2147483647, t={-1:0}, t={-1:0}]
[L84]                int a = min(t);
[L85]                int b;
        VAL          [a=2147483647, b={3:0}, t={-1:0}, t={-1:0}]
[L87]   CALL, EXPR   size(t)
        VAL          [t={-1:0}]
[L79]   COND FALSE   !(!t)
[L80]   EXPR         t->left
        VAL          [t={-1:0}, t={-1:0}, t->left={0:0}]
[L80]   CALL, EXPR   size(t->left)
        VAL          [t={0:0}]
[L79]   COND TRUE    !t
[L79]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L80]   RET, EXPR    size(t->left)
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}]
[L80]   EXPR         t->right
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L80]   CALL, EXPR   size(t->right)
        VAL          [t={0:0}]
[L79]   COND TRUE    !t
[L79]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L80]   RET, EXPR    size(t->right)
        VAL          [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L80]                return size(t->left) + size(t->right) + 1;
[L87]   RET, EXPR    size(t)
        VAL          [a=2147483647, b={3:0}, size(t)=1, t={-1:0}, t={-1:0}]
[L87]                int n = size(t);
[L88]   CALL         assume_cycle_if_not(n != 0)
        VAL          [\old(cond)=1]
[L9]    COND FALSE   !(!cond)
        VAL          [\old(cond)=1, cond=1]
[L88]   RET          assume_cycle_if_not(n != 0)
        VAL          [a=2147483647, b={3:0}, n=1, t={-1:0}, t={-1:0}]
[L89]   EXPR, FCALL  calloc(n, sizeof(int))
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}]
[L89]                int *x = calloc(n, sizeof(int));
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}]
[L90]   CALL         tree_inorder(t, x, n)
        VAL          [\old(i)=1, a={-2:0}, t={-1:0}]
[L68]   COND FALSE   !(!t)
[L71]   EXPR         t->left
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}]
[L71]   CALL, EXPR   tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={-2:0}, t={0:0}]
[L68]   COND TRUE    !t
[L69]                return i;
        VAL          [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}]
[L71]   RET, EXPR    tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left,  a, i)=1]
[L71]                i = tree_inorder(t->left,  a, i)
[L72]   EXPR         i++
[L72]   EXPR         t->data
[L72]                a[i++] = t->data
[L73]   EXPR         t->right
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}]
[L73]   CALL, EXPR   tree_inorder(t->right, a, i)
        VAL          [\old(i)=2, a={-2:0}, t={0:0}]
[L68]   COND TRUE    !t
[L69]                return i;
        VAL          [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}]
[L73]   RET, EXPR    tree_inorder(t->right, a, i)
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2]
[L73]                i = tree_inorder(t->right, a, i)
[L74]                return i;
        VAL          [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}]
[L90]   RET          tree_inorder(t, x, n)
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}]
[L91]   EXPR         x[0]
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0]
[L91]   CALL         __VERIFIER_assert(a == x[0])
        VAL          [\old(cond)=0]
[L14]   COND TRUE    !cond
        VAL          [\old(cond)=0, cond=0]
[L14]                __VERIFIER_error()
        VAL          [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 12 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 344 SDtfs, 629 SDslu, 1360 SDs, 0 SdLazy, 1905 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 54726 SizeOfPredicates, 6 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 74/78 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...