/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:04:49,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:04:49,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:04:49,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:04:49,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:04:49,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:04:49,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:04:49,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:04:49,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:04:49,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:04:49,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:04:49,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:04:49,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:04:49,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:04:49,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:04:49,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:04:49,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:04:49,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:04:49,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:04:49,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:04:49,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:04:49,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:04:49,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:04:49,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:04:49,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:04:49,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:04:49,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:04:49,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:04:49,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:04:49,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:04:49,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:04:49,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:04:49,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:04:49,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:04:49,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:04:49,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:04:49,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:04:49,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:04:49,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:04:49,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:04:49,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:04:49,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:04:49,244 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:04:49,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:04:49,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:04:49,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:04:49,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:04:49,246 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:04:49,246 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:04:49,247 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:04:49,247 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:04:49,247 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:04:49,247 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:04:49,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:04:49,247 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:04:49,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:04:49,250 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:04:49,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:04:49,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:04:49,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:04:49,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:04:49,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:04:49,252 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:04:49,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:04:49,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:04:49,253 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:04:49,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:04:49,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:04:49,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:04:49,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:04:49,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:04:49,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:04:49,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:04:49,571 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:04:49,571 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:04:49,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-04-01 00:04:50,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:04:51,041 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:04:51,042 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-04-01 00:04:51,047 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177e8dd55/6a7593e6ea7e411cbe42212a2e6d895a/FLAG22344becb [2023-04-01 00:04:51,060 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177e8dd55/6a7593e6ea7e411cbe42212a2e6d895a [2023-04-01 00:04:51,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:04:51,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:04:51,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:04:51,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:04:51,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:04:51,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc7216a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51, skipping insertion in model container [2023-04-01 00:04:51,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:04:51,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:04:51,219 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2023-04-01 00:04:51,240 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 00:04:51,241 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 00:04:51,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:04:51,286 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:04:51,293 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2023-04-01 00:04:51,298 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 00:04:51,299 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 00:04:51,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:04:51,318 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:04:51,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51 WrapperNode [2023-04-01 00:04:51,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:04:51,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:04:51,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:04:51,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:04:51,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:04:51,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:04:51,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:04:51,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:04:51,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (1/1) ... [2023-04-01 00:04:51,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:04:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:04:51,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 00:04:51,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 00:04:51,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-04-01 00:04:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2023-04-01 00:04:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:04:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-04-01 00:04:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 00:04:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 00:04:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 00:04:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure task [2023-04-01 00:04:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 00:04:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-04-01 00:04:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:04:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:04:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:04:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:04:51,540 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:04:51,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:04:51,913 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:04:51,949 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:04:51,950 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 00:04:51,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:04:51 BoogieIcfgContainer [2023-04-01 00:04:51,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:04:51,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:04:51,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:04:51,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:04:51,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:04:51" (1/3) ... [2023-04-01 00:04:51,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658037d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:04:51, skipping insertion in model container [2023-04-01 00:04:51,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:04:51" (2/3) ... [2023-04-01 00:04:51,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658037d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:04:51, skipping insertion in model container [2023-04-01 00:04:51,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:04:51" (3/3) ... [2023-04-01 00:04:51,964 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-04-01 00:04:51,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:04:51,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:04:52,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:04:52,035 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c0c98f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:04:52,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:04:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-04-01 00:04:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 00:04:52,047 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:04:52,048 INFO L195 NwaCegarLoop]: 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] [2023-04-01 00:04:52,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:04:52,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:04:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1109045648, now seen corresponding path program 1 times [2023-04-01 00:04:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:04:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659173950] [2023-04-01 00:04:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:04:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:04:52,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:04:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659173950] [2023-04-01 00:04:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659173950] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:04:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:04:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:04:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784964270] [2023-04-01 00:04:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:04:52,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:04:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:04:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:04:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:04:52,627 INFO L87 Difference]: Start difference. First operand has 87 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 00:04:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:04:52,788 INFO L93 Difference]: Finished difference Result 148 states and 191 transitions. [2023-04-01 00:04:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:04:52,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2023-04-01 00:04:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:04:52,820 INFO L225 Difference]: With dead ends: 148 [2023-04-01 00:04:52,821 INFO L226 Difference]: Without dead ends: 84 [2023-04-01 00:04:52,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:04:52,826 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:04:52,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 474 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:04:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-04-01 00:04:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-04-01 00:04:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-04-01 00:04:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2023-04-01 00:04:52,888 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 41 [2023-04-01 00:04:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:04:52,889 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2023-04-01 00:04:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 00:04:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2023-04-01 00:04:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 00:04:52,891 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:04:52,891 INFO L195 NwaCegarLoop]: 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] [2023-04-01 00:04:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:04:52,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:04:52,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:04:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1950089633, now seen corresponding path program 1 times [2023-04-01 00:04:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:04:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997956689] [2023-04-01 00:04:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:04:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:04:53,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:04:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997956689] [2023-04-01 00:04:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997956689] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:04:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001316584] [2023-04-01 00:04:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:04:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:04:53,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:04:53,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:04:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:53,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-01 00:04:53,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:04:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:04:53,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:04:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:04:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001316584] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:04:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [940641672] [2023-04-01 00:04:53,571 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2023-04-01 00:04:53,571 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:04:53,576 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:04:53,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:04:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2023-04-01 00:04:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902595834] [2023-04-01 00:04:53,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:04:53,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:04:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:04:53,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:04:53,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:04:53,582 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 00:04:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:04:53,723 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2023-04-01 00:04:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:04:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 53 [2023-04-01 00:04:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:04:53,729 INFO L225 Difference]: With dead ends: 149 [2023-04-01 00:04:53,729 INFO L226 Difference]: Without dead ends: 86 [2023-04-01 00:04:53,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:04:53,734 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:04:53,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 502 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:04:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-04-01 00:04:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-04-01 00:04:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (29), 24 states have call predecessors, (29), 24 states have call successors, (29) [2023-04-01 00:04:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2023-04-01 00:04:53,756 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 53 [2023-04-01 00:04:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:04:53,757 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2023-04-01 00:04:53,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 00:04:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2023-04-01 00:04:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-04-01 00:04:53,759 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:04:53,759 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 00:04:53,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 00:04:53,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:04:53,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:04:53,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:04:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -22996784, now seen corresponding path program 1 times [2023-04-01 00:04:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:04:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623986286] [2023-04-01 00:04:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:04:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:04:54,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:04:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623986286] [2023-04-01 00:04:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623986286] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:04:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:04:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 00:04:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331331397] [2023-04-01 00:04:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:04:54,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:04:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:04:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:04:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:04:54,154 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 00:04:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:04:54,267 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2023-04-01 00:04:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:04:54,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 65 [2023-04-01 00:04:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:04:54,269 INFO L225 Difference]: With dead ends: 148 [2023-04-01 00:04:54,269 INFO L226 Difference]: Without dead ends: 88 [2023-04-01 00:04:54,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-04-01 00:04:54,270 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:04:54,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 600 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:04:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-01 00:04:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-04-01 00:04:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 26 states have call successors, (26), 11 states have call predecessors, (26), 12 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2023-04-01 00:04:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2023-04-01 00:04:54,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 65 [2023-04-01 00:04:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:04:54,279 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2023-04-01 00:04:54,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 00:04:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2023-04-01 00:04:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-04-01 00:04:54,281 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:04:54,281 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 00:04:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 00:04:54,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:04:54,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:04:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash 487760965, now seen corresponding path program 1 times [2023-04-01 00:04:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:04:54,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630878144] [2023-04-01 00:04:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:04:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 00:04:54,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:04:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630878144] [2023-04-01 00:04:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630878144] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:04:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255705806] [2023-04-01 00:04:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:54,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:04:54,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:04:54,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:04:54,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:04:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:04:54,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 15 conjunts are in the unsatisfiable core [2023-04-01 00:04:54,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:04:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-01 00:04:54,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 00:04:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255705806] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:04:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 00:04:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 17 [2023-04-01 00:04:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848598017] [2023-04-01 00:04:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:04:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:04:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:04:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:04:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:04:54,775 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 00:04:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:04:54,912 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2023-04-01 00:04:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:04:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 77 [2023-04-01 00:04:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:04:54,917 INFO L225 Difference]: With dead ends: 140 [2023-04-01 00:04:54,917 INFO L226 Difference]: Without dead ends: 90 [2023-04-01 00:04:54,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:04:54,921 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 33 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:04:54,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 593 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:04:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-04-01 00:04:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-04-01 00:04:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2023-04-01 00:04:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2023-04-01 00:04:54,934 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 77 [2023-04-01 00:04:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:04:54,935 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2023-04-01 00:04:54,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 00:04:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2023-04-01 00:04:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-04-01 00:04:54,937 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:04:54,937 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 00:04:54,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:04:55,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 00:04:55,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:04:55,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:04:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1995040648, now seen corresponding path program 1 times [2023-04-01 00:04:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:04:55,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297063379] [2023-04-01 00:04:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:04:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:04:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 00:04:55,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 00:04:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 00:04:55,272 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 00:04:55,272 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 00:04:55,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 00:04:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 00:04:55,276 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-04-01 00:04:55,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 00:04:55,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:04:55 BoogieIcfgContainer [2023-04-01 00:04:55,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 00:04:55,308 INFO L158 Benchmark]: Toolchain (without parser) took 4244.87ms. Allocated memory is still 342.9MB. Free memory was 300.8MB in the beginning and 163.4MB in the end (delta: 137.4MB). Peak memory consumption was 138.8MB. Max. memory is 8.0GB. [2023-04-01 00:04:55,308 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 00:04:55,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.48ms. Allocated memory is still 342.9MB. Free memory was 300.6MB in the beginning and 288.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-01 00:04:55,309 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 342.9MB. Free memory was 288.4MB in the beginning and 286.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 00:04:55,309 INFO L158 Benchmark]: RCFGBuilder took 578.78ms. Allocated memory is still 342.9MB. Free memory was 285.9MB in the beginning and 262.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-04-01 00:04:55,309 INFO L158 Benchmark]: TraceAbstraction took 3354.37ms. Allocated memory is still 342.9MB. Free memory was 261.8MB in the beginning and 163.4MB in the end (delta: 98.4MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2023-04-01 00:04:55,310 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.48ms. Allocated memory is still 342.9MB. Free memory was 300.6MB in the beginning and 288.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 342.9MB. Free memory was 288.4MB in the beginning and 286.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.78ms. Allocated memory is still 342.9MB. Free memory was 285.9MB in the beginning and 262.3MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3354.37ms. Allocated memory is still 342.9MB. Free memory was 261.8MB in the beginning and 163.4MB in the end (delta: 98.4MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L98] CALL task(nondet_tree()) VAL [t={-1:0}] [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n->left={0:0}, n={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n->left={0:0}, n={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n->right={0:0}, n={-1:0}, n={-1:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n->right={0:0}, n={-1:0}, n={-1:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t->left={0:0}, t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t->left={0:0}, t={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [size(t->left)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L83] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 2169 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1800 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 369 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 32, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 7 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/132 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! [2023-04-01 00:04:55,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...