/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-05ce600 [2022-02-24 01:49:52,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:49:52,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:49:53,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:49:53,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:49:53,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:49:53,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:49:53,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:49:53,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:49:53,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:49:53,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:49:53,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:49:53,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:49:53,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:49:53,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:49:53,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:49:53,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:49:53,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:49:53,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:49:53,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:49:53,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:49:53,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:49:53,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:49:53,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:49:53,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:49:53,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:49:53,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:49:53,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:49:53,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:49:53,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:49:53,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:49:53,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:49:53,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:49:53,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:49:53,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:49:53,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:49:53,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:49:53,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:49:53,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:49:53,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:49:53,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:49:53,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:49:53,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:49:53,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:49:53,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:49:53,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:49:53,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:49:53,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:49:53,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:49:53,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:49:53,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:49:53,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:49:53,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:49:53,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:49:53,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:49:53,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:49:53,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:49:53,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:49:53,089 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:49:53,089 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-02-24 01:49:53,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:49:53,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:49:53,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:49:53,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:49:53,347 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:49:53,348 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-02-24 01:49:53,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998858275/0fbc126ac10543a2ada5060d910c3637/FLAG3d02dddfc [2022-02-24 01:49:53,862 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:49:53,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-02-24 01:49:53,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998858275/0fbc126ac10543a2ada5060d910c3637/FLAG3d02dddfc [2022-02-24 01:49:53,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998858275/0fbc126ac10543a2ada5060d910c3637 [2022-02-24 01:49:53,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:49:53,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:49:53,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:49:53,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:49:53,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:49:53,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:49:53" (1/1) ... [2022-02-24 01:49:53,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c50b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:53, skipping insertion in model container [2022-02-24 01:49:53,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:49:53" (1/1) ... [2022-02-24 01:49:53,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:49:53,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:49:54,112 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-02-24 01:49:54,145 WARN L1545 CHandler]: Possible shadowing of function min [2022-02-24 01:49:54,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:49:54,178 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:49:54,192 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-02-24 01:49:54,211 WARN L1545 CHandler]: Possible shadowing of function min [2022-02-24 01:49:54,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:49:54,232 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:49:54,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54 WrapperNode [2022-02-24 01:49:54,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:49:54,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:49:54,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:49:54,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:49:54,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:49:54,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:49:54,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:49:54,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:49:54,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (1/1) ... [2022-02-24 01:49:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:49:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:49:54,336 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-02-24 01:49:54,368 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-02-24 01:49:54,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:49:54,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:49:54,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-02-24 01:49:54,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-02-24 01:49:54,384 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-02-24 01:49:54,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:49:54,385 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-24 01:49:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-24 01:49:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-24 01:49:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-02-24 01:49:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 01:49:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-24 01:49:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-02-24 01:49:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-24 01:49:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-24 01:49:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:49:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:49:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:49:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:49:54,552 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:49:54,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:49:54,847 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:49:54,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:49:54,854 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-24 01:49:54,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:49:54 BoogieIcfgContainer [2022-02-24 01:49:54,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:49:54,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:49:54,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:49:54,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:49:54,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:49:53" (1/3) ... [2022-02-24 01:49:54,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c795f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:49:54, skipping insertion in model container [2022-02-24 01:49:54,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:49:54" (2/3) ... [2022-02-24 01:49:54,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c795f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:49:54, skipping insertion in model container [2022-02-24 01:49:54,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:49:54" (3/3) ... [2022-02-24 01:49:54,864 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-02-24 01:49:54,868 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:49:54,868 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:49:54,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:49:54,916 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:49:54,916 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:49:54,936 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-02-24 01:49:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-24 01:49:54,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:49:54,948 INFO L514 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-02-24 01:49:54,948 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:49:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:49:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2022-02-24 01:49:54,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:49:54,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1875896798] [2022-02-24 01:49:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:49:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:49:55,016 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:49:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:49:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:49:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:49:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 01:49:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-24 01:49:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-24 01:49:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 01:49:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:49:55,415 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:49:55,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1875896798] [2022-02-24 01:49:55,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1875896798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:49:55,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:49:55,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 01:49:55,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064448492] [2022-02-24 01:49:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:49:55,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 01:49:55,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:49:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 01:49:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-24 01:49:55,476 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-02-24 01:49:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:49:56,278 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-02-24 01:49:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 01:49:56,280 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-02-24 01:49:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:49:56,289 INFO L225 Difference]: With dead ends: 174 [2022-02-24 01:49:56,289 INFO L226 Difference]: Without dead ends: 98 [2022-02-24 01:49:56,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-02-24 01:49:56,295 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-02-24 01:49:56,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 01:49:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-24 01:49:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-02-24 01:49:56,338 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-02-24 01:49:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-02-24 01:49:56,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-02-24 01:49:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:49:56,342 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-02-24 01:49:56,342 INFO L471 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-02-24 01:49:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-02-24 01:49:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-24 01:49:56,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:49:56,345 INFO L514 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-02-24 01:49:56,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:49:56,346 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:49:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:49:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2022-02-24 01:49:56,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:49:56,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207510201] [2022-02-24 01:49:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:49:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:49:56,350 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:49:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:49:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:49:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:49:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 01:49:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:49:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:49:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 01:49:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 01:49:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-24 01:49:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-24 01:49:56,628 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:49:56,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207510201] [2022-02-24 01:49:56,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [207510201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:49:56,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:49:56,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 01:49:56,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966774973] [2022-02-24 01:49:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:49:56,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 01:49:56,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:49:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 01:49:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:49:56,632 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-02-24 01:49:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:49:57,483 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-02-24 01:49:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 01:49:57,483 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-02-24 01:49:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:49:57,490 INFO L225 Difference]: With dead ends: 165 [2022-02-24 01:49:57,490 INFO L226 Difference]: Without dead ends: 97 [2022-02-24 01:49:57,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-02-24 01:49:57,492 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-02-24 01:49:57,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 84 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 01:49:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-24 01:49:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-02-24 01:49:57,510 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-02-24 01:49:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-02-24 01:49:57,512 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-02-24 01:49:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:49:57,512 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-02-24 01:49:57,512 INFO L471 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-02-24 01:49:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-24 01:49:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-24 01:49:57,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:49:57,514 INFO L514 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-02-24 01:49:57,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:49:57,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:49:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:49:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2022-02-24 01:49:57,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:49:57,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [467843088] [2022-02-24 01:49:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:49:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:49:57,519 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:49:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:49:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:49:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 01:49:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:49:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 01:49:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 01:49:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:49:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:49:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-24 01:49:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-24 01:49:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-24 01:49:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-24 01:49:57,723 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:49:57,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [467843088] [2022-02-24 01:49:57,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [467843088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:49:57,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:49:57,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 01:49:57,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016886215] [2022-02-24 01:49:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:49:57,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 01:49:57,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:49:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 01:49:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:49:57,725 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-02-24 01:49:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:49:58,411 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-02-24 01:49:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 01:49:58,412 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-02-24 01:49:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:49:58,414 INFO L225 Difference]: With dead ends: 164 [2022-02-24 01:49:58,414 INFO L226 Difference]: Without dead ends: 99 [2022-02-24 01:49:58,415 INFO L932 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-02-24 01:49:58,416 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 01:49:58,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 01:49:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-24 01:49:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-02-24 01:49:58,447 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-02-24 01:49:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-02-24 01:49:58,449 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-02-24 01:49:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:49:58,450 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-02-24 01:49:58,450 INFO L471 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-02-24 01:49:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-02-24 01:49:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-24 01:49:58,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:49:58,452 INFO L514 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-02-24 01:49:58,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:49:58,452 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:49:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:49:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2022-02-24 01:49:58,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:49:58,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436861675] [2022-02-24 01:49:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:49:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:49:58,455 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:49:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:49:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:49:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 01:49:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:49:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 01:49:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:49:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:49:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-24 01:49:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:49:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:49:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-24 01:49:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-24 01:49:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 01:49:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:49:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-24 01:49:58,788 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:49:58,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436861675] [2022-02-24 01:49:58,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [436861675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:49:58,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:49:58,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-24 01:49:58,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874172547] [2022-02-24 01:49:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:49:58,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 01:49:58,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:49:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 01:49:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-02-24 01:49:58,792 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-02-24 01:49:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:49:59,648 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2022-02-24 01:49:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-24 01:49:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-02-24 01:49:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:49:59,651 INFO L225 Difference]: With dead ends: 152 [2022-02-24 01:49:59,651 INFO L226 Difference]: Without dead ends: 99 [2022-02-24 01:49:59,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-02-24 01:49:59,653 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 192 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 01:49:59,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 90 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 01:49:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-24 01:49:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-02-24 01:49:59,666 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-02-24 01:49:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-02-24 01:49:59,668 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-02-24 01:49:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:49:59,668 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-02-24 01:49:59,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-02-24 01:49:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-02-24 01:49:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-24 01:49:59,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:49:59,671 INFO L514 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-02-24 01:49:59,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:49:59,671 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:49:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:49:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2022-02-24 01:49:59,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:49:59,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426603342] [2022-02-24 01:49:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:49:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:49:59,674 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:49:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-24 01:49:59,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-24 01:49:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-24 01:49:59,756 INFO L138 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-02-24 01:49:59,756 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-24 01:49:59,760 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:49:59,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:49:59,764 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-24 01:49:59,766 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:49:59,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:49:59 BoogieIcfgContainer [2022-02-24 01:49:59,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:49:59,790 INFO L158 Benchmark]: Toolchain (without parser) took 5906.02ms. Allocated memory was 177.2MB in the beginning and 229.6MB in the end (delta: 52.4MB). Free memory was 125.4MB in the beginning and 100.1MB in the end (delta: 25.4MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-02-24 01:49:59,794 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory was 142.6MB in the beginning and 142.6MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:49:59,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.93ms. Allocated memory is still 177.2MB. Free memory was 125.2MB in the beginning and 150.3MB in the end (delta: -25.1MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-02-24 01:49:59,799 INFO L158 Benchmark]: Boogie Preprocessor took 64.47ms. Allocated memory is still 177.2MB. Free memory was 150.3MB in the beginning and 148.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 01:49:59,799 INFO L158 Benchmark]: RCFGBuilder took 555.99ms. Allocated memory is still 177.2MB. Free memory was 148.0MB in the beginning and 128.6MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-24 01:49:59,799 INFO L158 Benchmark]: TraceAbstraction took 4931.89ms. Allocated memory was 177.2MB in the beginning and 229.6MB in the end (delta: 52.4MB). Free memory was 128.1MB in the beginning and 100.1MB in the end (delta: 28.1MB). Peak memory consumption was 82.0MB. Max. memory is 8.0GB. [2022-02-24 01:49:59,801 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 177.2MB. Free memory was 142.6MB in the beginning and 142.6MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.93ms. Allocated memory is still 177.2MB. Free memory was 125.2MB in the beginning and 150.3MB in the end (delta: -25.1MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.47ms. Allocated memory is still 177.2MB. Free memory was 150.3MB in the beginning and 148.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 555.99ms. Allocated memory is still 177.2MB. Free memory was 148.0MB in the beginning and 128.6MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4931.89ms. Allocated memory was 177.2MB in the beginning and 229.6MB in the end (delta: 52.4MB). Free memory was 128.1MB in the beginning and 100.1MB in the end (delta: 28.1MB). Peak memory consumption was 82.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3484 IncrementalHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 291 mSDtfsCounter, 3484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 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-02-24 01:49:59,838 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...