/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 23:30:55,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 23:30:55,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 23:30:55,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 23:30:55,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 23:30:55,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 23:30:55,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 23:30:55,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 23:30:55,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 23:30:55,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 23:30:55,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 23:30:55,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 23:30:55,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 23:30:56,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 23:30:56,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 23:30:56,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 23:30:56,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 23:30:56,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 23:30:56,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 23:30:56,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 23:30:56,006 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 23:30:56,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 23:30:56,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 23:30:56,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 23:30:56,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 23:30:56,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 23:30:56,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 23:30:56,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 23:30:56,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 23:30:56,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 23:30:56,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 23:30:56,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 23:30:56,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 23:30:56,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 23:30:56,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 23:30:56,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 23:30:56,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 23:30:56,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 23:30:56,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 23:30:56,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 23:30:56,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 23:30:56,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 23:30:56,027 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 [2022-03-19 23:30:56,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 23:30:56,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 23:30:56,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 23:30:56,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 23:30:56,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 23:30:56,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 23:30:56,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 23:30:56,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 23:30:56,043 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 23:30:56,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 23:30:56,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 23:30:56,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 23:30:56,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 23:30:56,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 23:30:56,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 23:30:56,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 23:30:56,046 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 23:30:56,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 23:30:56,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 23:30:56,046 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 23:30:56,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 23:30:56,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 23:30:56,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 23:30:56,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 23:30:56,282 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 23:30:56,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-03-19 23:30:56,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322bd60d2/29d030a5b76c4f969d512338972eb966/FLAGd7d115012 [2022-03-19 23:30:56,734 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 23:30:56,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-03-19 23:30:56,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322bd60d2/29d030a5b76c4f969d512338972eb966/FLAGd7d115012 [2022-03-19 23:30:56,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322bd60d2/29d030a5b76c4f969d512338972eb966 [2022-03-19 23:30:56,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 23:30:56,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 23:30:56,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 23:30:56,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 23:30:56,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 23:30:56,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:56,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65930702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56, skipping insertion in model container [2022-03-19 23:30:56,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:56,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 23:30:56,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 23:30:56,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-03-19 23:30:56,924 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-19 23:30:56,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 23:30:56,940 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 23:30:56,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-03-19 23:30:56,953 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-19 23:30:56,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 23:30:56,968 INFO L208 MainTranslator]: Completed translation [2022-03-19 23:30:56,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56 WrapperNode [2022-03-19 23:30:56,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 23:30:56,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 23:30:56,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 23:30:56,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 23:30:56,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:56,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:56,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:56,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:57,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:57,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:57,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:57,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 23:30:57,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 23:30:57,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 23:30:57,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 23:30:57,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (1/1) ... [2022-03-19 23:30:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 23:30:57,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 23:30:57,047 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) [2022-03-19 23:30:57,056 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 [2022-03-19 23:30:57,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 23:30:57,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-03-19 23:30:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-03-19 23:30:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 23:30:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 23:30:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-03-19 23:30:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 23:30:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 23:30:57,205 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 23:30:57,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 23:30:57,440 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 23:30:57,445 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 23:30:57,445 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-19 23:30:57,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:30:57 BoogieIcfgContainer [2022-03-19 23:30:57,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 23:30:57,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 23:30:57,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 23:30:57,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 23:30:57,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 11:30:56" (1/3) ... [2022-03-19 23:30:57,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f1109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:30:57, skipping insertion in model container [2022-03-19 23:30:57,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:30:56" (2/3) ... [2022-03-19 23:30:57,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f1109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:30:57, skipping insertion in model container [2022-03-19 23:30:57,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:30:57" (3/3) ... [2022-03-19 23:30:57,464 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-03-19 23:30:57,467 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 23:30:57,467 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 23:30:57,503 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 23:30:57,508 INFO L340 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 [2022-03-19 23:30:57,508 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 23:30:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-19 23:30:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 23:30:57,532 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:30:57,533 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:30:57,533 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:30:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:30:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-03-19 23:30:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:30:57,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583728334] [2022-03-19 23:30:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:30:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:30:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 23:30:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 23:30:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-19 23:30:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 23:30:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-19 23:30:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-19 23:30:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 23:30:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 23:30:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 23:30:57,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583728334] [2022-03-19 23:30:57,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583728334] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 23:30:57,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 23:30:57,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 23:30:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268372991] [2022-03-19 23:30:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 23:30:57,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 23:30:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 23:30:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 23:30:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 23:30:57,874 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2022-03-19 23:30:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 23:30:58,199 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-03-19 23:30:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 23:30:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 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 44 [2022-03-19 23:30:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 23:30:58,211 INFO L225 Difference]: With dead ends: 168 [2022-03-19 23:30:58,211 INFO L226 Difference]: Without dead ends: 95 [2022-03-19 23:30:58,215 INFO L912 BasicCegarLoop]: 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 [2022-03-19 23:30:58,218 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 23:30:58,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 23:30:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-19 23:30:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-03-19 23:30:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-19 23:30:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-03-19 23:30:58,254 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-03-19 23:30:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 23:30:58,255 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-03-19 23:30:58,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 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) [2022-03-19 23:30:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-03-19 23:30:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 23:30:58,257 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:30:58,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:30:58,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 23:30:58,258 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:30:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:30:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-03-19 23:30:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:30:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43403395] [2022-03-19 23:30:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:30:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:30:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 23:30:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 23:30:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-19 23:30:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 23:30:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-19 23:30:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-19 23:30:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-19 23:30:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 23:30:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 23:30:58,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43403395] [2022-03-19 23:30:58,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43403395] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 23:30:58,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 23:30:58,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-19 23:30:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65664030] [2022-03-19 23:30:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 23:30:58,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-19 23:30:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 23:30:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-19 23:30:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-19 23:30:58,434 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-03-19 23:30:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 23:30:58,946 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-03-19 23:30:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-19 23:30:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 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 44 [2022-03-19 23:30:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 23:30:58,948 INFO L225 Difference]: With dead ends: 154 [2022-03-19 23:30:58,949 INFO L226 Difference]: Without dead ends: 97 [2022-03-19 23:30:58,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-03-19 23:30:58,950 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 23:30:58,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 79 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 23:30:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-19 23:30:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-03-19 23:30:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-03-19 23:30:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-03-19 23:30:58,960 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-03-19 23:30:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 23:30:58,961 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-03-19 23:30:58,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-03-19 23:30:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-03-19 23:30:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-19 23:30:58,966 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:30:58,966 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:30:58,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 23:30:58,966 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:30:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:30:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-03-19 23:30:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:30:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440671283] [2022-03-19 23:30:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:30:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:30:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 23:30:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 23:30:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-19 23:30:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-19 23:30:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 23:30:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 23:30:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-19 23:30:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-19 23:30:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-19 23:30:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-19 23:30:59,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 23:30:59,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440671283] [2022-03-19 23:30:59,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440671283] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 23:30:59,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208171360] [2022-03-19 23:30:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:30:59,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 23:30:59,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 23:30:59,210 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) [2022-03-19 23:30:59,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 23:30:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:30:59,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-19 23:30:59,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 23:30:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-19 23:30:59,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 23:30:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-19 23:30:59,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208171360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 23:30:59,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 23:30:59,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-03-19 23:30:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299562255] [2022-03-19 23:30:59,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 23:30:59,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-19 23:30:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 23:30:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-19 23:30:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-19 23:30:59,784 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-19 23:31:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 23:31:00,424 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-03-19 23:31:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 23:31:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-03-19 23:31:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 23:31:00,427 INFO L225 Difference]: With dead ends: 164 [2022-03-19 23:31:00,427 INFO L226 Difference]: Without dead ends: 96 [2022-03-19 23:31:00,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-03-19 23:31:00,428 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 108 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 23:31:00,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 84 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 23:31:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-19 23:31:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-03-19 23:31:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-03-19 23:31:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-03-19 23:31:00,441 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-03-19 23:31:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 23:31:00,442 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-03-19 23:31:00,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-19 23:31:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-03-19 23:31:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-19 23:31:00,447 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:31:00,449 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:31:00,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 23:31:00,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 23:31:00,664 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:31:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:31:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-03-19 23:31:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:31:00,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870743840] [2022-03-19 23:31:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:31:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:31:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 23:31:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 23:31:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 23:31:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 23:31:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 23:31:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-19 23:31:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 23:31:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 23:31:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-03-19 23:31:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-03-19 23:31:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-19 23:31:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-19 23:31:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 23:31:00,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870743840] [2022-03-19 23:31:00,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870743840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 23:31:00,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 23:31:00,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 23:31:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990288844] [2022-03-19 23:31:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 23:31:00,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 23:31:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 23:31:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 23:31:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-19 23:31:00,825 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 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) [2022-03-19 23:31:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 23:31:01,343 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-03-19 23:31:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-19 23:31:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 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 66 [2022-03-19 23:31:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 23:31:01,344 INFO L225 Difference]: With dead ends: 163 [2022-03-19 23:31:01,344 INFO L226 Difference]: Without dead ends: 98 [2022-03-19 23:31:01,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-03-19 23:31:01,346 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 23:31:01,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 23:31:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-19 23:31:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-03-19 23:31:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-03-19 23:31:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-03-19 23:31:01,355 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-03-19 23:31:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 23:31:01,355 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-03-19 23:31:01,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 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) [2022-03-19 23:31:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-03-19 23:31:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-19 23:31:01,359 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:31:01,359 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:31:01,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 23:31:01,359 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:31:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:31:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-03-19 23:31:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:31:01,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572533799] [2022-03-19 23:31:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:31:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:31:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 23:31:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-19 23:31:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-19 23:31:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 23:31:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-19 23:31:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 23:31:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 23:31:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-03-19 23:31:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-19 23:31:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-19 23:31:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-03-19 23:31:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-19 23:31:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-19 23:31:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 23:31:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-19 23:31:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 23:31:01,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572533799] [2022-03-19 23:31:01,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572533799] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 23:31:01,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 23:31:01,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-19 23:31:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129611092] [2022-03-19 23:31:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 23:31:01,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-19 23:31:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 23:31:01,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-19 23:31:01,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-19 23:31:01,510 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-03-19 23:31:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 23:31:02,019 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-03-19 23:31:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-19 23:31:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 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 79 [2022-03-19 23:31:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 23:31:02,020 INFO L225 Difference]: With dead ends: 151 [2022-03-19 23:31:02,021 INFO L226 Difference]: Without dead ends: 98 [2022-03-19 23:31:02,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-03-19 23:31:02,022 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-19 23:31:02,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 82 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 23:31:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-19 23:31:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-03-19 23:31:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-03-19 23:31:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-03-19 23:31:02,029 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-03-19 23:31:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 23:31:02,030 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-03-19 23:31:02,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-03-19 23:31:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-03-19 23:31:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-19 23:31:02,031 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 23:31:02,031 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 23:31:02,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 23:31:02,031 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 23:31:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 23:31:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-03-19 23:31:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 23:31:02,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186162715] [2022-03-19 23:31:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 23:31:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 23:31:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-19 23:31:02,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-19 23:31:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-19 23:31:02,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-19 23:31:02,144 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-19 23:31:02,144 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 23:31:02,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 23:31:02,148 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-03-19 23:31:02,150 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 23:31:02,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 11:31:02 BoogieIcfgContainer [2022-03-19 23:31:02,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 23:31:02,192 INFO L158 Benchmark]: Toolchain (without parser) took 5438.88ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 138.1MB in the beginning and 111.5MB in the end (delta: 26.6MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. [2022-03-19 23:31:02,192 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 23:31:02,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 189.8MB. Free memory was 137.9MB in the beginning and 162.3MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-19 23:31:02,192 INFO L158 Benchmark]: Boogie Preprocessor took 43.58ms. Allocated memory is still 189.8MB. Free memory was 162.3MB in the beginning and 160.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 23:31:02,192 INFO L158 Benchmark]: RCFGBuilder took 433.20ms. Allocated memory is still 189.8MB. Free memory was 160.0MB in the beginning and 141.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-19 23:31:02,193 INFO L158 Benchmark]: TraceAbstraction took 4743.28ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 140.9MB in the beginning and 111.5MB in the end (delta: 29.3MB). Peak memory consumption was 68.9MB. Max. memory is 8.0GB. [2022-03-19 23:31:02,194 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 189.8MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 189.8MB. Free memory was 137.9MB in the beginning and 162.3MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.58ms. Allocated memory is still 189.8MB. Free memory was 162.3MB in the beginning and 160.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 433.20ms. Allocated memory is still 189.8MB. Free memory was 160.0MB in the beginning and 141.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4743.28ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 140.9MB in the beginning and 111.5MB in the end (delta: 29.3MB). Peak memory consumption was 68.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: [L105] 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={-2: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={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) VAL [t={-2:0}] [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0: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={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0: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={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}, t={-2:0}] [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] 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: 4.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 789 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3337 IncrementalHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 353 mSDtfsCounter, 3337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, 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, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1065 SizeOfPredicates, 4 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 84/90 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! [2022-03-19 23:31:02,219 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...