/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:42:51,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:42:51,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:42:51,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:42:51,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:42:51,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:42:51,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:42:51,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:42:51,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:42:51,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:42:51,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:42:51,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:42:51,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:42:51,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:42:51,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:42:51,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:42:51,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:42:51,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:42:51,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:42:51,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:42:51,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:42:51,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:42:51,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:42:51,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:42:51,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:42:51,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:42:51,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:42:51,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:42:51,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:42:51,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:42:51,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:42:51,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:42:51,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:42:51,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:42:51,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:42:51,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:42:51,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:42:51,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:42:51,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:42:51,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:42:51,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:42:51,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 04:42:51,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:42:51,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:42:51,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:42:51,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:42:51,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:42:51,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:42:51,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:42:51,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:42:51,128 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:42:51,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:42:51,129 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:42:51,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:42:51,131 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:42:51,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:42:51,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:42:51,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:42:51,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:42:51,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:42:51,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:42:51,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:42:51,133 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:42:51,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:42:51,133 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:42:51,133 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 04:42:51,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:42:51,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:42:51,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:42:51,379 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:42:51,380 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:42:51,381 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-02 04:42:52,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:42:52,776 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:42:52,776 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-04-02 04:42:52,782 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4c502dd/5063d89062334a3cb824da9aa6b3257e/FLAGc05e65200 [2023-04-02 04:42:52,798 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4c502dd/5063d89062334a3cb824da9aa6b3257e [2023-04-02 04:42:52,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:42:52,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:42:52,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:42:52,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:42:52,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:42:52,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:42:52" (1/1) ... [2023-04-02 04:42:52,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237b3d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:52, skipping insertion in model container [2023-04-02 04:42:52,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:42:52" (1/1) ... [2023-04-02 04:42:52,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:42:52,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:42:52,970 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-02 04:42:52,990 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-02 04:42:52,993 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-02 04:42:53,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:42:53,021 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:42:53,030 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-02 04:42:53,034 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-02 04:42:53,035 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-02 04:42:53,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:42:53,054 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:42:53,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53 WrapperNode [2023-04-02 04:42:53,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:42:53,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:42:53,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:42:53,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:42:53,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:42:53,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:42:53,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:42:53,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:42:53,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (1/1) ... [2023-04-02 04:42:53,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:42:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:42:53,132 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-02 04:42:53,134 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-02 04:42:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:42:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:42:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 04:42:53,163 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:42:53,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:42:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:42:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure task [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:42:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:42:53,266 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:42:53,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:42:53,693 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:42:53,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:42:53,703 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 04:42:53,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:42:53 BoogieIcfgContainer [2023-04-02 04:42:53,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:42:53,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:42:53,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:42:53,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:42:53,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:42:52" (1/3) ... [2023-04-02 04:42:53,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c37fb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:42:53, skipping insertion in model container [2023-04-02 04:42:53,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:42:53" (2/3) ... [2023-04-02 04:42:53,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c37fb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:42:53, skipping insertion in model container [2023-04-02 04:42:53,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:42:53" (3/3) ... [2023-04-02 04:42:53,713 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-04-02 04:42:53,728 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:42:53,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:42:53,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:42:53,790 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=PETRI_NET, 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;@37b45818, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:42:53,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:42:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 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-02 04:42:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-02 04:42:53,814 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:53,815 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, 1, 1, 1, 1] [2023-04-02 04:42:53,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:53,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:53,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1820526394, now seen corresponding path program 1 times [2023-04-02 04:42:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384138802] [2023-04-02 04:42:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:42:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-04-02 04:42:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:42:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 04:42:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:42:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:42:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-04-02 04:42:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:54,233 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-02 04:42:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:42:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384138802] [2023-04-02 04:42:54,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384138802] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:42:54,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:42:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 04:42:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614875355] [2023-04-02 04:42:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:42:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 04:42:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:42:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 04:42:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-04-02 04:42:54,276 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 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, 6 states have (on average 4.666666666666667) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 04:42:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:42:54,782 INFO L93 Difference]: Finished difference Result 166 states and 216 transitions. [2023-04-02 04:42:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 04:42:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-04-02 04:42:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:42:54,799 INFO L225 Difference]: With dead ends: 166 [2023-04-02 04:42:54,800 INFO L226 Difference]: Without dead ends: 94 [2023-04-02 04:42:54,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-04-02 04:42:54,810 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 149 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:42:54,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 8 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 04:42:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-02 04:42:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2023-04-02 04:42:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 26 states have call successors, (26), 11 states have call predecessors, (26), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-04-02 04:42:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2023-04-02 04:42:54,885 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 45 [2023-04-02 04:42:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:42:54,886 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2023-04-02 04:42:54,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 04:42:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2023-04-02 04:42:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-02 04:42:54,888 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:54,889 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, 1, 1, 1, 1] [2023-04-02 04:42:54,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:42:54,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:54,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 785497160, now seen corresponding path program 1 times [2023-04-02 04:42:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389685879] [2023-04-02 04:42:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:42:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-04-02 04:42:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:42:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 04:42:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:42:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:42:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-04-02 04:42:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:55,171 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-02 04:42:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:42:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389685879] [2023-04-02 04:42:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389685879] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:42:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:42:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:42:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498345430] [2023-04-02 04:42:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:42:55,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:42:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:42:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:42:55,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:42:55,175 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (10), 6 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-02 04:42:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:42:55,806 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2023-04-02 04:42:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 04:42:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (10), 6 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 45 [2023-04-02 04:42:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:42:55,809 INFO L225 Difference]: With dead ends: 152 [2023-04-02 04:42:55,809 INFO L226 Difference]: Without dead ends: 96 [2023-04-02 04:42:55,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:42:55,811 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 151 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:42:55,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 13 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:42:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-04-02 04:42:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2023-04-02 04:42:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 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-02 04:42:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2023-04-02 04:42:55,826 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 45 [2023-04-02 04:42:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:42:55,827 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2023-04-02 04:42:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (10), 6 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-02 04:42:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2023-04-02 04:42:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-04-02 04:42:55,829 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:55,829 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, 1, 1, 1, 1] [2023-04-02 04:42:55,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:42:55,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:55,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1333264007, now seen corresponding path program 1 times [2023-04-02 04:42:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725659132] [2023-04-02 04:42:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:42:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-04-02 04:42:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:42:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 04:42:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-04-02 04:42:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-04-02 04:42:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:42:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,210 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-02 04:42:56,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:42:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725659132] [2023-04-02 04:42:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725659132] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:42:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559627738] [2023-04-02 04:42:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:56,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:42:56,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:42:56,217 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-02 04:42:56,240 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-02 04:42:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:56,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 04:42:56,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:42:56,499 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-02 04:42:56,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 04:42:56,710 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-02 04:42:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559627738] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 04:42:56,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 04:42:56,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 13 [2023-04-02 04:42:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773306208] [2023-04-02 04:42:56,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 04:42:56,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:42:56,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:42:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:42:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:42:56,714 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (19), 7 states have call predecessors, (19), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-02 04:42:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:42:57,464 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2023-04-02 04:42:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-02 04:42:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (19), 7 states have call predecessors, (19), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 57 [2023-04-02 04:42:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:42:57,470 INFO L225 Difference]: With dead ends: 162 [2023-04-02 04:42:57,470 INFO L226 Difference]: Without dead ends: 95 [2023-04-02 04:42:57,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:42:57,475 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 156 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:42:57,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 17 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:42:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-02 04:42:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2023-04-02 04:42:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 56 states have internal predecessors, (61), 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-02 04:42:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2023-04-02 04:42:57,497 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 57 [2023-04-02 04:42:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:42:57,497 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2023-04-02 04:42:57,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (19), 7 states have call predecessors, (19), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-02 04:42:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2023-04-02 04:42:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-04-02 04:42:57,499 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:57,499 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, 1, 1, 1, 1] [2023-04-02 04:42:57,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 04:42:57,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:42:57,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:57,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -790661912, now seen corresponding path program 1 times [2023-04-02 04:42:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900875767] [2023-04-02 04:42:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:42:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-04-02 04:42:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:42:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:42:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:42:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-04-02 04:42:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:42:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:58,010 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-02 04:42:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:42:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900875767] [2023-04-02 04:42:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900875767] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:42:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:42:58,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:42:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808304554] [2023-04-02 04:42:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:42:58,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:42:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:42:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:42:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:42:58,016 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (14), 7 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-02 04:42:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:42:58,707 INFO L93 Difference]: Finished difference Result 161 states and 206 transitions. [2023-04-02 04:42:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 04:42:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (14), 7 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 69 [2023-04-02 04:42:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:42:58,711 INFO L225 Difference]: With dead ends: 161 [2023-04-02 04:42:58,711 INFO L226 Difference]: Without dead ends: 97 [2023-04-02 04:42:58,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2023-04-02 04:42:58,712 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 176 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:42:58,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 17 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 04:42:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-02 04:42:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2023-04-02 04:42:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 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-02 04:42:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2023-04-02 04:42:58,730 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 69 [2023-04-02 04:42:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:42:58,731 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2023-04-02 04:42:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 5 states have call successors, (14), 7 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-02 04:42:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2023-04-02 04:42:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-04-02 04:42:58,739 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:58,739 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, 1, 1, 1, 1, 1] [2023-04-02 04:42:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:42:58,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:58,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 351152062, now seen corresponding path program 1 times [2023-04-02 04:42:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823560967] [2023-04-02 04:42:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:42:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-04-02 04:42:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:42:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-04-02 04:42:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:42:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:42:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-04-02 04:42:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-04-02 04:42:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-04-02 04:42:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,280 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-02 04:42:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:42:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823560967] [2023-04-02 04:42:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823560967] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 04:42:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870169937] [2023-04-02 04:42:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:59,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:42:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:42:59,285 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-02 04:42:59,314 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-02 04:42:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:42:59,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 15 conjunts are in the unsatisfiable core [2023-04-02 04:42:59,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 04:42:59,514 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-02 04:42:59,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 04:42:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870169937] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:42:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 04:42:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 21 [2023-04-02 04:42:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546244183] [2023-04-02 04:42:59,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:42:59,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:42:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:42:59,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:42:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2023-04-02 04:42:59,516 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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-02 04:42:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:42:59,652 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2023-04-02 04:42:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 04:42:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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 82 [2023-04-02 04:42:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:42:59,654 INFO L225 Difference]: With dead ends: 148 [2023-04-02 04:42:59,654 INFO L226 Difference]: Without dead ends: 96 [2023-04-02 04:42:59,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2023-04-02 04:42:59,656 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:42:59,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 685 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 04:42:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-04-02 04:42:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-04-02 04:42:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.125) internal successors, (63), 60 states have internal predecessors, (63), 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-02 04:42:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2023-04-02 04:42:59,686 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 82 [2023-04-02 04:42:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:42:59,686 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2023-04-02 04:42:59,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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-02 04:42:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2023-04-02 04:42:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-04-02 04:42:59,688 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:42:59,688 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, 1, 1, 1, 1, 1] [2023-04-02 04:42:59,698 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-02 04:42:59,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 04:42:59,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:42:59,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:42:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1488137841, now seen corresponding path program 1 times [2023-04-02 04:42:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:42:59,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647779619] [2023-04-02 04:42:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:42:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:42:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:42:59,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 04:42:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:42:59,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 04:42:59,977 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 04:42:59,978 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:42:59,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:42:59,991 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-04-02 04:42:59,997 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:43:00,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:43:00 BoogieIcfgContainer [2023-04-02 04:43:00,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:43:00,051 INFO L158 Benchmark]: Toolchain (without parser) took 7248.80ms. Allocated memory was 304.1MB in the beginning and 364.9MB in the end (delta: 60.8MB). Free memory was 266.0MB in the beginning and 214.1MB in the end (delta: 51.8MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2023-04-02 04:43:00,051 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:43:00,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.75ms. Allocated memory is still 304.1MB. Free memory was 265.4MB in the beginning and 253.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-02 04:43:00,051 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory is still 304.1MB. Free memory was 253.8MB in the beginning and 251.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 04:43:00,052 INFO L158 Benchmark]: RCFGBuilder took 608.25ms. Allocated memory is still 304.1MB. Free memory was 251.2MB in the beginning and 229.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-04-02 04:43:00,052 INFO L158 Benchmark]: TraceAbstraction took 6343.41ms. Allocated memory was 304.1MB in the beginning and 364.9MB in the end (delta: 60.8MB). Free memory was 228.7MB in the beginning and 214.1MB in the end (delta: 14.5MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2023-04-02 04:43:00,053 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.12ms. Allocated memory is still 197.1MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.75ms. Allocated memory is still 304.1MB. Free memory was 265.4MB in the beginning and 253.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.61ms. Allocated memory is still 304.1MB. Free memory was 253.8MB in the beginning and 251.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 608.25ms. Allocated memory is still 304.1MB. Free memory was 251.2MB in the beginning and 229.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6343.41ms. Allocated memory was 304.1MB in the beginning and 364.9MB in the end (delta: 60.8MB). Free memory was 228.7MB in the beginning and 214.1MB in the end (delta: 14.5MB). Peak memory consumption was 75.9MB. 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) VAL [\old(cond)=1, cond=1] [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))={-3: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))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3: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={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3: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={-3:0}, a={-3: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={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3: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={-3:0}, a={-3: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))={-3:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L83] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3: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, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 624 mSDsCounter, 480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2914 IncrementalHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 480 mSolverCounterUnsat, 116 mSDtfsCounter, 2914 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 1301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 709 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 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-02 04:43:00,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...