/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 13:33:41,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 13:33:41,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 13:33:41,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 13:33:41,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 13:33:41,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 13:33:41,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 13:33:41,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 13:33:41,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 13:33:41,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 13:33:41,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 13:33:41,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 13:33:41,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 13:33:41,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 13:33:41,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 13:33:41,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 13:33:41,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 13:33:41,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 13:33:41,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 13:33:41,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 13:33:41,269 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 13:33:41,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 13:33:41,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 13:33:41,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 13:33:41,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 13:33:41,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 13:33:41,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 13:33:41,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 13:33:41,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 13:33:41,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 13:33:41,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 13:33:41,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 13:33:41,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 13:33:41,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 13:33:41,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 13:33:41,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 13:33:41,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 13:33:41,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 13:33:41,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 13:33:41,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 13:33:41,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 13:33:41,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 13:33:41,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 13:33:41,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 13:33:41,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 13:33:41,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 13:33:41,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 13:33:41,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 13:33:41,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 13:33:41,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 13:33:41,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 13:33:41,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 13:33:41,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:33:41,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 13:33:41,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 13:33:41,297 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 13:33:41,297 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-20 13:33:41,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 13:33:41,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 13:33:41,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 13:33:41,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 13:33:41,499 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 13:33:41,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-03-20 13:33:41,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2096af4/289f93e9d799459ab1abe00de59dee31/FLAGdbf627cb6 [2022-03-20 13:33:41,952 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 13:33:41,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-03-20 13:33:41,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2096af4/289f93e9d799459ab1abe00de59dee31/FLAGdbf627cb6 [2022-03-20 13:33:41,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2096af4/289f93e9d799459ab1abe00de59dee31 [2022-03-20 13:33:41,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 13:33:41,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 13:33:41,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 13:33:41,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 13:33:42,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 13:33:42,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:33:41" (1/1) ... [2022-03-20 13:33:42,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d14078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42, skipping insertion in model container [2022-03-20 13:33:42,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:33:41" (1/1) ... [2022-03-20 13:33:42,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 13:33:42,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 13:33:42,208 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.c[586,599] [2022-03-20 13:33:42,244 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-20 13:33:42,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:33:42,276 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 13:33:42,290 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.c[586,599] [2022-03-20 13:33:42,307 WARN L1550 CHandler]: Possible shadowing of function min [2022-03-20 13:33:42,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 13:33:42,338 INFO L208 MainTranslator]: Completed translation [2022-03-20 13:33:42,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42 WrapperNode [2022-03-20 13:33:42,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 13:33:42,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 13:33:42,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 13:33:42,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 13:33:42,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 13:33:42,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 13:33:42,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 13:33:42,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 13:33:42,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (1/1) ... [2022-03-20 13:33:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 13:33:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:33:42,440 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-20 13:33:42,453 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-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-03-20 13:33:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-03-20 13:33:42,493 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-03-20 13:33:42,493 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-03-20 13:33:42,494 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-03-20 13:33:42,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 13:33:42,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-20 13:33:42,494 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-20 13:33:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-03-20 13:33:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-03-20 13:33:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 13:33:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-03-20 13:33:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-03-20 13:33:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-03-20 13:33:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 13:33:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 13:33:42,594 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 13:33:42,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 13:33:42,878 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 13:33:42,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 13:33:42,882 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-20 13:33:42,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:33:42 BoogieIcfgContainer [2022-03-20 13:33:42,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 13:33:42,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 13:33:42,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 13:33:42,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 13:33:42,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:33:41" (1/3) ... [2022-03-20 13:33:42,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50646685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:33:42, skipping insertion in model container [2022-03-20 13:33:42,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:33:42" (2/3) ... [2022-03-20 13:33:42,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50646685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:33:42, skipping insertion in model container [2022-03-20 13:33:42,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:33:42" (3/3) ... [2022-03-20 13:33:42,891 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-03-20 13:33:42,894 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 13:33:42,894 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 13:33:42,926 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 13:33:42,931 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-20 13:33:42,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 13:33:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 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-20 13:33:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 13:33:42,951 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:42,951 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-20 13:33:42,952 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2022-03-20 13:33:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:42,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601497023] [2022-03-20 13:33:42,969 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 2 times [2022-03-20 13:33:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641478839] [2022-03-20 13:33:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 13:33:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 13:33:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-03-20 13:33:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 13:33:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 13:33:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,323 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-20 13:33:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:43,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641478839] [2022-03-20 13:33:43,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641478839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:43,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:43,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 13:33:43,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601497023] [2022-03-20 13:33:43,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601497023] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:43,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:43,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 13:33:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435647046] [2022-03-20 13:33:43,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:43,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 13:33:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 13:33:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-20 13:33:43,354 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 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 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-20 13:33:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:43,876 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-03-20 13:33:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 13:33:43,878 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-20 13:33:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:43,884 INFO L225 Difference]: With dead ends: 174 [2022-03-20 13:33:43,884 INFO L226 Difference]: Without dead ends: 98 [2022-03-20 13:33:43,886 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-20 13:33:43,888 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:43,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-20 13:33:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-03-20 13:33:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 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-20 13:33:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-03-20 13:33:43,919 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-03-20 13:33:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:43,920 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-03-20 13:33:43,920 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-20 13:33:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-03-20 13:33:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-20 13:33:43,922 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:43,922 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-20 13:33:43,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 13:33:43,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2022-03-20 13:33:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493956020] [2022-03-20 13:33:43,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 2 times [2022-03-20 13:33:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:43,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374688813] [2022-03-20 13:33:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 13:33:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 13:33:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 13:33:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 13:33:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 13:33:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:44,168 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-20 13:33:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:44,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374688813] [2022-03-20 13:33:44,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374688813] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 13:33:44,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733730358] [2022-03-20 13:33:44,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:33:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:33:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:33:44,184 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-20 13:33:44,185 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-20 13:33:44,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 13:33:44,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:33:44,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 13:33:44,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:33:44,488 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-20 13:33:44,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 13:33:44,702 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-20 13:33:44,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733730358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 13:33:44,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 13:33:44,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-03-20 13:33:44,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:44,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493956020] [2022-03-20 13:33:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493956020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277870216] [2022-03-20 13:33:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:44,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 13:33:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 13:33:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-20 13:33:44,705 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-03-20 13:33:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:45,323 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-03-20 13:33:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 13:33:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-03-20 13:33:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:45,325 INFO L225 Difference]: With dead ends: 165 [2022-03-20 13:33:45,325 INFO L226 Difference]: Without dead ends: 97 [2022-03-20 13:33:45,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-20 13:33:45,327 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:45,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 84 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-20 13:33:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-03-20 13:33:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 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-20 13:33:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-03-20 13:33:45,338 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-03-20 13:33:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:45,338 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-03-20 13:33:45,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-03-20 13:33:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-03-20 13:33:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-03-20 13:33:45,345 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:45,346 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-20 13:33:45,390 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-20 13:33:45,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:33:45,547 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2022-03-20 13:33:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:45,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521214499] [2022-03-20 13:33:45,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 2 times [2022-03-20 13:33:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:45,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129046854] [2022-03-20 13:33:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 13:33:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 13:33:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 13:33:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 13:33:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-03-20 13:33:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-03-20 13:33:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-03-20 13:33:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:45,725 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-20 13:33:45,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:45,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129046854] [2022-03-20 13:33:45,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129046854] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:45,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:45,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:45,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:45,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521214499] [2022-03-20 13:33:45,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521214499] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:45,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:45,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 13:33:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448832355] [2022-03-20 13:33:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:45,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 13:33:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 13:33:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-03-20 13:33:45,727 INFO L87 Difference]: Start difference. First operand 93 states and 118 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-20 13:33:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:46,227 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-03-20 13:33:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 13:33:46,227 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-20 13:33:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:46,229 INFO L225 Difference]: With dead ends: 164 [2022-03-20 13:33:46,229 INFO L226 Difference]: Without dead ends: 99 [2022-03-20 13:33:46,230 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-20 13:33:46,230 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 178 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:46,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 84 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 13:33:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-03-20 13:33:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-03-20 13:33:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 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-20 13:33:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-03-20 13:33:46,243 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-03-20 13:33:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:46,243 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-03-20 13:33:46,243 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-20 13:33:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-03-20 13:33:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-20 13:33:46,245 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:46,245 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-20 13:33:46,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 13:33:46,245 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:46,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2022-03-20 13:33:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497122464] [2022-03-20 13:33:46,246 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 2 times [2022-03-20 13:33:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:46,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738121407] [2022-03-20 13:33:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 13:33:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 13:33:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 13:33:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 13:33:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 13:33:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-03-20 13:33:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 13:33:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 13:33:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-03-20 13:33:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-03-20 13:33:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-03-20 13:33:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 13:33:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-03-20 13:33:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 13:33:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738121407] [2022-03-20 13:33:46,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738121407] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 13:33:46,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225315906] [2022-03-20 13:33:46,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 13:33:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 13:33:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 13:33:46,431 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) [2022-03-20 13:33:46,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 13:33:46,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 13:33:46,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 13:33:46,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 13:33:46,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 13:33:46,700 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-20 13:33:46,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 13:33:46,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225315906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:46,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 13:33:46,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 20 [2022-03-20 13:33:46,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 13:33:46,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497122464] [2022-03-20 13:33:46,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497122464] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 13:33:46,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 13:33:46,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 13:33:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401237053] [2022-03-20 13:33:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 13:33:46,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 13:33:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:46,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 13:33:46,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-03-20 13:33:46,702 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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) [2022-03-20 13:33:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 13:33:46,813 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2022-03-20 13:33:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 13:33:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 79 [2022-03-20 13:33:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 13:33:46,817 INFO L225 Difference]: With dead ends: 150 [2022-03-20 13:33:46,817 INFO L226 Difference]: Without dead ends: 97 [2022-03-20 13:33:46,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-03-20 13:33:46,818 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 13:33:46,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 748 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 13:33:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-03-20 13:33:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-03-20 13:33:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 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-20 13:33:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-03-20 13:33:46,850 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-03-20 13:33:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 13:33:46,851 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-03-20 13:33:46,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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) [2022-03-20 13:33:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-03-20 13:33:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-20 13:33:46,859 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 13:33:46,859 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-20 13:33:46,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 13:33:47,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 13:33:47,060 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 13:33:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 13:33:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2022-03-20 13:33:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 13:33:47,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447739449] [2022-03-20 13:33:47,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 13:33:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 2 times [2022-03-20 13:33:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 13:33:47,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890151617] [2022-03-20 13:33:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 13:33:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 13:33:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 13:33:47,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 13:33:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 13:33:47,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 13:33:47,155 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-03-20 13:33:47,155 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 13:33:47,157 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 13:33:47,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 13:33:47,185 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-03-20 13:33:47,187 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 13:33:47,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 01:33:47 BoogieIcfgContainer [2022-03-20 13:33:47,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 13:33:47,207 INFO L158 Benchmark]: Toolchain (without parser) took 5211.57ms. Allocated memory was 194.0MB in the beginning and 267.4MB in the end (delta: 73.4MB). Free memory was 167.9MB in the beginning and 204.7MB in the end (delta: -36.9MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2022-03-20 13:33:47,207 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 13:33:47,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.13ms. Allocated memory was 194.0MB in the beginning and 267.4MB in the end (delta: 73.4MB). Free memory was 167.5MB in the beginning and 234.9MB in the end (delta: -67.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-03-20 13:33:47,208 INFO L158 Benchmark]: Boogie Preprocessor took 61.94ms. Allocated memory is still 267.4MB. Free memory was 234.9MB in the beginning and 232.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 13:33:47,208 INFO L158 Benchmark]: RCFGBuilder took 481.45ms. Allocated memory is still 267.4MB. Free memory was 232.5MB in the beginning and 213.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-20 13:33:47,208 INFO L158 Benchmark]: TraceAbstraction took 4322.44ms. Allocated memory is still 267.4MB. Free memory was 212.9MB in the beginning and 204.7MB in the end (delta: 8.2MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-03-20 13:33:47,209 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.09ms. Allocated memory is still 194.0MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.13ms. Allocated memory was 194.0MB in the beginning and 267.4MB in the end (delta: 73.4MB). Free memory was 167.5MB in the beginning and 234.9MB in the end (delta: -67.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.94ms. Allocated memory is still 267.4MB. Free memory was 234.9MB in the beginning and 232.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 481.45ms. Allocated memory is still 267.4MB. Free memory was 232.5MB in the beginning and 213.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4322.44ms. Allocated memory is still 267.4MB. Free memory was 212.9MB in the beginning and 204.7MB in the end (delta: 8.2MB). Peak memory consumption was 7.5MB. 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: [L110] 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; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left [L41] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->left) [L41] int b = min(n->left); [L42] EXPR n->right [L42] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L42] RET, EXPR min(n->right) [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) [L81] COND FALSE !(!t) [L82] EXPR t->left [L82] CALL, EXPR size(t->left) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->left) [L82] EXPR t->right [L82] CALL, EXPR size(t->right) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->right) [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) [L70] COND FALSE !(!t) [L73] EXPR t->left [L73] CALL, EXPR tree_inorder(t->left, a, i) [L70] COND TRUE !t [L71] return i; [L73] RET, EXPR tree_inorder(t->left, a, i) [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right [L75] CALL, EXPR tree_inorder(t->right, a, i) [L70] COND TRUE !t [L71] return i; [L75] RET, EXPR tree_inorder(t->right, a, i) [L75] i = tree_inorder(t->right, a, i) [L76] return i; [L92] RET tree_inorder(t, x, n) [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 1013 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 688 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2373 IncrementalHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 325 mSDtfsCounter, 2373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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-20 13:33:47,247 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...