/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 13:35:54,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 13:35:54,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 13:35:54,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 13:35:54,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 13:35:54,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 13:35:54,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 13:35:54,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 13:35:54,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 13:35:54,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 13:35:54,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 13:35:54,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 13:35:54,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 13:35:54,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 13:35:54,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 13:35:54,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 13:35:54,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 13:35:54,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 13:35:54,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 13:35:54,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 13:35:54,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 13:35:54,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 13:35:54,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 13:35:54,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 13:35:54,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 13:35:54,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 13:35:54,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 13:35:54,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 13:35:54,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 13:35:54,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 13:35:54,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 13:35:54,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 13:35:54,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 13:35:54,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 13:35:54,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 13:35:54,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 13:35:54,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 13:35:54,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 13:35:54,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 13:35:54,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 13:35:54,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 13:35:54,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 13:35:54,883 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 13:35:54,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 13:35:54,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 13:35:54,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 13:35:54,885 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 13:35:54,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 13:35:54,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 13:35:54,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 13:35:54,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 13:35:54,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:35:54,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 13:35:54,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 13:35:54,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 13:35:54,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 13:35:54,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 13:35:54,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 13:35:54,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 13:35:54,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 13:35:55,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 13:35:55,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 13:35:55,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 13:35:55,171 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 13:35:55,174 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 13:35:55,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-02 13:35:55,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f142e82d/a12ede57589741d6b79c3246ecfa455b/FLAGa68106cc4 [2021-05-02 13:35:55,643 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 13:35:55,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-02 13:35:55,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f142e82d/a12ede57589741d6b79c3246ecfa455b/FLAGa68106cc4 [2021-05-02 13:35:55,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f142e82d/a12ede57589741d6b79c3246ecfa455b [2021-05-02 13:35:55,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 13:35:55,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 13:35:55,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 13:35:55,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 13:35:55,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 13:35:55,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:55,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190f4c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55, skipping insertion in model container [2021-05-02 13:35:55,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:55,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 13:35:55,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 13:35:55,821 WARN L224 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] [2021-05-02 13:35:55,846 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-02 13:35:55,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:35:55,917 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 13:35:55,928 WARN L224 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] [2021-05-02 13:35:55,943 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-02 13:35:55,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:35:55,971 INFO L208 MainTranslator]: Completed translation [2021-05-02 13:35:55,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55 WrapperNode [2021-05-02 13:35:55,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 13:35:55,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 13:35:55,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 13:35:55,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 13:35:55,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:55,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... [2021-05-02 13:35:56,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 13:35:56,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 13:35:56,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 13:35:56,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 13:35:56,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 13:35:56,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-05-02 13:35:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-05-02 13:35:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-05-02 13:35:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-05-02 13:35:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-05-02 13:35:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2021-05-02 13:35:56,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 13:35:56,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2021-05-02 13:35:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 13:35:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 13:35:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 13:35:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 13:35:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 13:35:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure task [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 13:35:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 13:35:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 13:35:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 13:35:56,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 13:35:56,518 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-02 13:35:56,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:35:56 BoogieIcfgContainer [2021-05-02 13:35:56,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 13:35:56,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 13:35:56,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 13:35:56,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 13:35:56,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 01:35:55" (1/3) ... [2021-05-02 13:35:56,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8cc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:35:56, skipping insertion in model container [2021-05-02 13:35:56,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:35:55" (2/3) ... [2021-05-02 13:35:56,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8cc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:35:56, skipping insertion in model container [2021-05-02 13:35:56,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:35:56" (3/3) ... [2021-05-02 13:35:56,525 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2021-05-02 13:35:56,529 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 13:35:56,532 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 13:35:56,543 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 13:35:56,559 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 13:35:56,559 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 13:35:56,559 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 13:35:56,559 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 13:35:56,560 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 13:35:56,560 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 13:35:56,560 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 13:35:56,560 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 13:35:56,571 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) [2021-05-02 13:35:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 13:35:56,576 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:35:56,576 INFO L523 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] [2021-05-02 13:35:56,577 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:35:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:35:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2021-05-02 13:35:56,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:35:56,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955740120] [2021-05-02 13:35:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:35:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:35:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:35:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 13:35:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 13:35:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 13:35:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-02 13:35:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 13:35:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:35:56,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:35:56,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955740120] [2021-05-02 13:35:56,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955740120] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:35:56,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:35:56,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 13:35:56,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529823941] [2021-05-02 13:35:56,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 13:35:56,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:35:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 13:35:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-05-02 13:35:56,912 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) [2021-05-02 13:35:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:35:57,534 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2021-05-02 13:35:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 13:35:57,536 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 [2021-05-02 13:35:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:35:57,547 INFO L225 Difference]: With dead ends: 174 [2021-05-02 13:35:57,548 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 13:35:57,552 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 247.3ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-05-02 13:35:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 13:35:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2021-05-02 13:35:57,595 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) [2021-05-02 13:35:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-05-02 13:35:57,597 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2021-05-02 13:35:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:35:57,598 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-05-02 13:35:57,598 INFO L481 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) [2021-05-02 13:35:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-05-02 13:35:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 13:35:57,600 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:35:57,600 INFO L523 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] [2021-05-02 13:35:57,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 13:35:57,600 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:35:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:35:57,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2021-05-02 13:35:57,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:35:57,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063517765] [2021-05-02 13:35:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:35:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:35:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:35:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 13:35:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 13:35:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:35:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:35:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-02 13:35:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 13:35:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-02 13:35:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 13:35:57,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:35:57,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063517765] [2021-05-02 13:35:57,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063517765] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:35:57,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600417055] [2021-05-02 13:35:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:35:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:57,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 25 conjunts are in the unsatisfiable core [2021-05-02 13:35:57,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:35:58,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:35:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 13:35:58,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600417055] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:35:58,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:35:58,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 12 [2021-05-02 13:35:58,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338541046] [2021-05-02 13:35:58,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 13:35:58,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:35:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 13:35:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:35:58,095 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-05-02 13:35:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:35:58,803 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2021-05-02 13:35:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 13:35:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 56 [2021-05-02 13:35:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:35:58,806 INFO L225 Difference]: With dead ends: 165 [2021-05-02 13:35:58,806 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 13:35:58,808 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 312.3ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-05-02 13:35:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 13:35:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-05-02 13:35:58,828 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) [2021-05-02 13:35:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2021-05-02 13:35:58,829 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2021-05-02 13:35:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:35:58,829 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2021-05-02 13:35:58,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-05-02 13:35:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2021-05-02 13:35:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 13:35:58,831 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:35:58,831 INFO L523 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] [2021-05-02 13:35:59,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-05-02 13:35:59,032 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:35:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:35:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2021-05-02 13:35:59,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:35:59,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480622213] [2021-05-02 13:35:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:35:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:35:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:35:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-02 13:35:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:35:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 13:35:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 13:35:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:35:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:35:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 13:35:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 13:35:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-05-02 13:35:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-05-02 13:35:59,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:35:59,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480622213] [2021-05-02 13:35:59,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480622213] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:35:59,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:35:59,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 13:35:59,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585411805] [2021-05-02 13:35:59,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 13:35:59,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:35:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 13:35:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-02 13:35:59,203 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) [2021-05-02 13:35:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:35:59,768 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2021-05-02 13:35:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 13:35:59,768 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 [2021-05-02 13:35:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:35:59,770 INFO L225 Difference]: With dead ends: 164 [2021-05-02 13:35:59,770 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 13:35:59,771 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 258.0ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:35:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 13:35:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-05-02 13:35:59,779 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) [2021-05-02 13:35:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2021-05-02 13:35:59,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2021-05-02 13:35:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:35:59,780 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2021-05-02 13:35:59,780 INFO L481 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) [2021-05-02 13:35:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2021-05-02 13:35:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 13:35:59,782 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:35:59,782 INFO L523 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] [2021-05-02 13:35:59,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 13:35:59,782 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:35:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:35:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2021-05-02 13:35:59,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:35:59,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950007657] [2021-05-02 13:35:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:35:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:35:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:35:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-02 13:35:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:35:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:35:59,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 13:35:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-02 13:36:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-02 13:36:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-05-02 13:36:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 13:36:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-05-02 13:36:00,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:00,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950007657] [2021-05-02 13:36:00,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950007657] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:36:00,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076774855] [2021-05-02 13:36:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:36:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:00,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 13:36:00,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:36:00,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-05-02 13:36:00,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076774855] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:36:00,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:36:00,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 21 [2021-05-02 13:36:00,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077424565] [2021-05-02 13:36:00,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:36:00,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:36:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:36:00,523 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) [2021-05-02 13:36:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:00,654 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2021-05-02 13:36:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:36:00,655 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 [2021-05-02 13:36:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:00,657 INFO L225 Difference]: With dead ends: 150 [2021-05-02 13:36:00,657 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 13:36:00,658 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 195.9ms TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2021-05-02 13:36:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 13:36:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 13:36:00,667 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) [2021-05-02 13:36:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2021-05-02 13:36:00,668 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2021-05-02 13:36:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:00,668 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2021-05-02 13:36:00,668 INFO L481 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) [2021-05-02 13:36:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2021-05-02 13:36:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 13:36:00,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:00,671 INFO L523 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] [2021-05-02 13:36:00,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:36:00,889 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2021-05-02 13:36:00,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:00,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904462456] [2021-05-02 13:36:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:36:00,913 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:36:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:36:00,936 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:36:00,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 13:36:00,961 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 13:36:00,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 13:36:01,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 01:36:01 BoogieIcfgContainer [2021-05-02 13:36:01,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 13:36:01,017 INFO L168 Benchmark]: Toolchain (without parser) took 5316.99 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 148.2 MB in the beginning and 111.3 MB in the end (delta: 36.9 MB). Peak memory consumption was 136.2 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:01,017 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 182.5 MB. Free memory is still 165.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 13:36:01,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.23 ms. Allocated memory is still 182.5 MB. Free memory was 148.0 MB in the beginning and 162.9 MB in the end (delta: -14.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:01,017 INFO L168 Benchmark]: Boogie Preprocessor took 62.59 ms. Allocated memory is still 182.5 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:01,017 INFO L168 Benchmark]: RCFGBuilder took 480.21 ms. Allocated memory is still 182.5 MB. Free memory was 160.8 MB in the beginning and 126.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:01,017 INFO L168 Benchmark]: TraceAbstraction took 4482.58 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 125.8 MB in the beginning and 111.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:01,018 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.15 ms. Allocated memory is still 182.5 MB. Free memory is still 165.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 287.23 ms. Allocated memory is still 182.5 MB. Free memory was 148.0 MB in the beginning and 162.9 MB in the end (delta: -14.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 62.59 ms. Allocated memory is still 182.5 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 480.21 ms. Allocated memory is still 182.5 MB. Free memory was 160.8 MB in the beginning and 126.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4482.58 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 125.8 MB in the beginning and 111.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 113.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L110] CALL task(nondet_tree()) VAL [t={-1:0}] [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L86] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={3:0}, t={-1:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={3:0}, size(t)=1, t={-1:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={3:0}, n=1, t={-1:0}, t={-1:0}] [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L93] EXPR x[0] VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4404.3ms, OverallIterations: 5, TraceHistogramMax: 3, EmptinessCheckTime: 14.0ms, AutomataDifference: 2065.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 365 SDtfs, 480 SDslu, 1669 SDs, 0 SdLazy, 1482 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1053.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1013.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 75.5ms AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 74.8ms SsaConstructionTime, 215.5ms SatisfiabilityAnalysisTime, 1196.3ms InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 SizeOfPredicates, 10 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 105/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...