./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max_incorrect.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_max_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:18:09,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:18:09,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:18:09,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:18:09,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:18:09,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:18:09,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:18:09,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:18:09,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:18:09,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:18:09,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:18:09,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:18:09,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:18:09,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:18:09,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:18:09,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:18:09,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:18:09,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:18:09,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:18:09,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:18:09,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:18:09,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:18:09,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:18:09,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:18:09,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:18:09,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:18:09,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:18:09,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:18:09,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:18:09,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:18:09,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:18:09,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:18:09,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:18:09,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:18:09,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:18:09,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:18:09,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:18:09,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:18:09,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:18:09,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:18:09,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:18:09,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:18:09,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:18:09,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:18:09,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:18:09,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:18:09,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:18:09,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:18:09,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:18:09,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:18:09,709 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:18:09,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:18:09,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:18:09,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:18:09,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:09,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:18:09,713 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:18:09,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:18:09,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:18:09,714 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f [2022-02-20 18:18:09,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:18:09,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:18:09,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:18:09,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:18:09,952 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:18:09,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max_incorrect.c [2022-02-20 18:18:10,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5fe51f8/42708d4d5b0f41c58308d2b0890ff7b6/FLAGe628e1758 [2022-02-20 18:18:10,419 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:18:10,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c [2022-02-20 18:18:10,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5fe51f8/42708d4d5b0f41c58308d2b0890ff7b6/FLAGe628e1758 [2022-02-20 18:18:10,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe5fe51f8/42708d4d5b0f41c58308d2b0890ff7b6 [2022-02-20 18:18:10,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:18:10,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:18:10,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:10,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:18:10,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:18:10,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1e3374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10, skipping insertion in model container [2022-02-20 18:18:10,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:18:10,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:18:10,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2022-02-20 18:18:10,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:10,624 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:18:10,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2022-02-20 18:18:10,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:10,649 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:18:10,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10 WrapperNode [2022-02-20 18:18:10,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:10,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:10,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:18:10,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:18:10,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,682 INFO L137 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2022-02-20 18:18:10,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:10,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:18:10,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:18:10,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:18:10,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:18:10,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:18:10,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:18:10,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:18:10,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (1/1) ... [2022-02-20 18:18:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:10,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:18:10,755 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-20 18:18:10,768 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-20 18:18:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 18:18:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:18:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-02-20 18:18:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-02-20 18:18:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-02-20 18:18:10,790 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-02-20 18:18:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:18:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-02-20 18:18:10,790 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-02-20 18:18:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 18:18:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 18:18:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 18:18:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:18:10,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:18:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 18:18:10,852 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:18:10,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:18:11,038 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:18:11,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:18:11,045 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:18:11,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:11 BoogieIcfgContainer [2022-02-20 18:18:11,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:18:11,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:18:11,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:18:11,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:18:11,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:18:10" (1/3) ... [2022-02-20 18:18:11,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da59fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:11, skipping insertion in model container [2022-02-20 18:18:11,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:10" (2/3) ... [2022-02-20 18:18:11,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da59fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:11, skipping insertion in model container [2022-02-20 18:18:11,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:11" (3/3) ... [2022-02-20 18:18:11,070 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2022-02-20 18:18:11,074 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:18:11,074 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:18:11,111 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:18:11,117 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:18:11,117 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:18:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:18:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 18:18:11,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:11,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:18:11,139 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -891537794, now seen corresponding path program 1 times [2022-02-20 18:18:11,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:11,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352116309] [2022-02-20 18:18:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:18:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:11,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-02-20 18:18:11,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-02-20 18:18:11,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {43#true} #72#return; {48#(and (= |ULTIMATE.start_main_#t~ret19#1.base| 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0))} is VALID [2022-02-20 18:18:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 18:18:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:11,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2022-02-20 18:18:11,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {43#true} is VALID [2022-02-20 18:18:11,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-02-20 18:18:11,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} #74#return; {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} is VALID [2022-02-20 18:18:11,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-02-20 18:18:11,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret19#1.base, main_#t~ret19#1.offset; {43#true} is VALID [2022-02-20 18:18:11,553 INFO L272 TraceCheckUtils]: 2: Hoare triple {43#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := nondet_tree(); {56#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:11,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-02-20 18:18:11,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2022-02-20 18:18:11,557 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57#(and (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.base|))} {43#true} #72#return; {48#(and (= |ULTIMATE.start_main_#t~ret19#1.base| 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0))} is VALID [2022-02-20 18:18:11,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#(and (= |ULTIMATE.start_main_#t~ret19#1.base| 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0))} assume { :begin_inline_task } true;task_#in~n#1.base, task_#in~n#1.offset := main_#t~ret19#1.base, main_#t~ret19#1.offset;havoc task_#t~ret18#1, task_~n#1.base, task_~n#1.offset, task_~a~1#1;task_~n#1.base, task_~n#1.offset := task_#in~n#1.base, task_#in~n#1.offset; {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} is VALID [2022-02-20 18:18:11,557 INFO L272 TraceCheckUtils]: 7: Hoare triple {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} call task_#t~ret18#1 := max(task_~n#1.base, task_~n#1.offset); {43#true} is VALID [2022-02-20 18:18:11,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2022-02-20 18:18:11,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {43#true} is VALID [2022-02-20 18:18:11,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#true} assume true; {43#true} is VALID [2022-02-20 18:18:11,559 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {43#true} {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} #74#return; {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} is VALID [2022-02-20 18:18:11,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} assume -2147483648 <= task_#t~ret18#1 && task_#t~ret18#1 <= 2147483647;task_~a~1#1 := task_#t~ret18#1;havoc task_#t~ret18#1; {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} is VALID [2022-02-20 18:18:11,560 INFO L272 TraceCheckUtils]: 13: Hoare triple {49#(and (= |ULTIMATE.start_task_~n#1.base| 0) (= |ULTIMATE.start_task_~n#1.offset| 0))} call check(task_~n#1.base, task_~n#1.offset, task_~a~1#1); {54#(and (= |check_#in~n#1.base| 0) (= |check_#in~n#1.offset| 0))} is VALID [2022-02-20 18:18:11,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {54#(and (= |check_#in~n#1.base| 0) (= |check_#in~n#1.offset| 0))} ~n#1.base, ~n#1.offset := #in~n#1.base, #in~n#1.offset;~a#1 := #in~a#1; {55#(and (= |check_~n#1.offset| 0) (= |check_~n#1.base| 0))} is VALID [2022-02-20 18:18:11,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {55#(and (= |check_~n#1.offset| 0) (= |check_~n#1.base| 0))} assume ~n#1.base != 0 || ~n#1.offset != 0;call #t~mem14#1 := read~int(~n#1.base, ~n#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if #t~mem14#1 <= ~a#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {44#false} is VALID [2022-02-20 18:18:11,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond#1; {44#false} is VALID [2022-02-20 18:18:11,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 18:18:11,562 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-20 18:18:11,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:11,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352116309] [2022-02-20 18:18:11,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352116309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:11,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:11,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:18:11,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033230150] [2022-02-20 18:18:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 18:18:11,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:11,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:11,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:11,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:18:11,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:18:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:18:11,619 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:12,344 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-02-20 18:18:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:18:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 18:18:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-02-20 18:18:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-02-20 18:18:12,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-02-20 18:18:12,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:12,479 INFO L225 Difference]: With dead ends: 73 [2022-02-20 18:18:12,479 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 18:18:12,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:18:12,489 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:12,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:18:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 18:18:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 18:18:12,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:12,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:12,529 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:12,530 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:12,546 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 18:18:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:12,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:12,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:12,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Second operand 34 states. [2022-02-20 18:18:12,548 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Second operand 34 states. [2022-02-20 18:18:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:12,550 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 18:18:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:12,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:12,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:12,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:12,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-20 18:18:12,554 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2022-02-20 18:18:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:12,555 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-20 18:18:12,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:18:12,556 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:12,556 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:18:12,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:18:12,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1509693249, now seen corresponding path program 1 times [2022-02-20 18:18:12,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:12,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586391331] [2022-02-20 18:18:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:12,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:18:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 18:18:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:12,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #68#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 18:18:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:12,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #70#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,739 INFO L272 TraceCheckUtils]: 1: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:12,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,740 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #68#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:12,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,743 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #70#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-02-20 18:18:12,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} assume true; {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-02-20 18:18:12,745 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} {275#true} #72#return; {290#(not (= |ULTIMATE.start_main_#t~ret19#1.base| 0))} is VALID [2022-02-20 18:18:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 18:18:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:12,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {305#(= max_~n.base |max_#in~n.base|)} is VALID [2022-02-20 18:18:12,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {306#(= |max_#in~n.base| 0)} is VALID [2022-02-20 18:18:12,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {306#(= |max_#in~n.base| 0)} assume true; {306#(= |max_#in~n.base| 0)} is VALID [2022-02-20 18:18:12,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {306#(= |max_#in~n.base| 0)} {291#(not (= |ULTIMATE.start_task_~n#1.base| 0))} #74#return; {276#false} is VALID [2022-02-20 18:18:12,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-02-20 18:18:12,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret19#1.base, main_#t~ret19#1.offset; {275#true} is VALID [2022-02-20 18:18:12,771 INFO L272 TraceCheckUtils]: 2: Hoare triple {275#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := nondet_tree(); {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:12,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume !(0 != #t~nondet5 % 256);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet7; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:12,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,776 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #68#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,781 INFO L272 TraceCheckUtils]: 9: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 18:18:12,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} assume 0 != #t~nondet5 % 256;havoc #t~nondet5;#res.base, #res.offset := 0, 0; {275#true} is VALID [2022-02-20 18:18:12,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} assume true; {275#true} is VALID [2022-02-20 18:18:12,782 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {275#true} {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} #70#return; {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} is VALID [2022-02-20 18:18:12,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(or (not (<= nondet_tree_~n~0.base 0)) (<= (+ nondet_tree_~n~0.base 1) 0))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-02-20 18:18:12,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} assume true; {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} is VALID [2022-02-20 18:18:12,784 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {304#(or (<= 1 |nondet_tree_#res.base|) (<= (+ |nondet_tree_#res.base| 1) 0))} {275#true} #72#return; {290#(not (= |ULTIMATE.start_main_#t~ret19#1.base| 0))} is VALID [2022-02-20 18:18:12,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#(not (= |ULTIMATE.start_main_#t~ret19#1.base| 0))} assume { :begin_inline_task } true;task_#in~n#1.base, task_#in~n#1.offset := main_#t~ret19#1.base, main_#t~ret19#1.offset;havoc task_#t~ret18#1, task_~n#1.base, task_~n#1.offset, task_~a~1#1;task_~n#1.base, task_~n#1.offset := task_#in~n#1.base, task_#in~n#1.offset; {291#(not (= |ULTIMATE.start_task_~n#1.base| 0))} is VALID [2022-02-20 18:18:12,785 INFO L272 TraceCheckUtils]: 17: Hoare triple {291#(not (= |ULTIMATE.start_task_~n#1.base| 0))} call task_#t~ret18#1 := max(task_~n#1.base, task_~n#1.offset); {275#true} is VALID [2022-02-20 18:18:12,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {305#(= max_~n.base |max_#in~n.base|)} is VALID [2022-02-20 18:18:12,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {306#(= |max_#in~n.base| 0)} is VALID [2022-02-20 18:18:12,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {306#(= |max_#in~n.base| 0)} assume true; {306#(= |max_#in~n.base| 0)} is VALID [2022-02-20 18:18:12,787 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {306#(= |max_#in~n.base| 0)} {291#(not (= |ULTIMATE.start_task_~n#1.base| 0))} #74#return; {276#false} is VALID [2022-02-20 18:18:12,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {276#false} assume -2147483648 <= task_#t~ret18#1 && task_#t~ret18#1 <= 2147483647;task_~a~1#1 := task_#t~ret18#1;havoc task_#t~ret18#1; {276#false} is VALID [2022-02-20 18:18:12,788 INFO L272 TraceCheckUtils]: 23: Hoare triple {276#false} call check(task_~n#1.base, task_~n#1.offset, task_~a~1#1); {276#false} is VALID [2022-02-20 18:18:12,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#false} ~n#1.base, ~n#1.offset := #in~n#1.base, #in~n#1.offset;~a#1 := #in~a#1; {276#false} is VALID [2022-02-20 18:18:12,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#false} assume ~n#1.base != 0 || ~n#1.offset != 0;call #t~mem14#1 := read~int(~n#1.base, ~n#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if #t~mem14#1 <= ~a#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {276#false} is VALID [2022-02-20 18:18:12,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {276#false} assume 0 == __VERIFIER_assert_~cond#1; {276#false} is VALID [2022-02-20 18:18:12,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-02-20 18:18:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 18:18:12,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:18:12,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586391331] [2022-02-20 18:18:12,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586391331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:12,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:12,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:18:12,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005766129] [2022-02-20 18:18:12,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 18:18:12,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:12,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:12,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:12,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:18:12,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:18:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:18:12,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:18:12,815 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:13,368 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-02-20 18:18:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:18:13,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 18:18:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 18:18:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 18:18:13,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2022-02-20 18:18:13,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:13,427 INFO L225 Difference]: With dead ends: 47 [2022-02-20 18:18:13,427 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 18:18:13,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:18:13,429 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:13,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:18:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 18:18:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 18:18:13,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:13,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:13,438 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:13,438 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:13,441 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 18:18:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:13,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:13,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:13,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Second operand 36 states. [2022-02-20 18:18:13,442 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Second operand 36 states. [2022-02-20 18:18:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:13,445 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 18:18:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:13,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:13,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:13,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:13,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-02-20 18:18:13,449 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 28 [2022-02-20 18:18:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:13,449 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-02-20 18:18:13,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:18:13,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:13,451 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] [2022-02-20 18:18:13,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:18:13,451 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -896236761, now seen corresponding path program 1 times [2022-02-20 18:18:13,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:18:13,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643829088] [2022-02-20 18:18:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:18:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:18:13,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:18:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:18:13,570 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:18:13,570 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:18:13,571 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location checkErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:18:13,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:18:13,574 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 18:18:13,577 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:18:13,606 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret19 := nondet_tree(); [2022-02-20 18:18:13,607 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:18:13,610 INFO L158 Benchmark]: Toolchain (without parser) took 3172.76ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 83.7MB in the beginning and 56.1MB in the end (delta: 27.6MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2022-02-20 18:18:13,611 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 39.8MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:18:13,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.53ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 91.1MB in the end (delta: -7.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 18:18:13,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.46ms. Allocated memory is still 115.3MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:18:13,612 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 88.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:18:13,612 INFO L158 Benchmark]: RCFGBuilder took 319.86ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 74.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 18:18:13,613 INFO L158 Benchmark]: TraceAbstraction took 2560.30ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 74.0MB in the beginning and 56.1MB in the end (delta: 17.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2022-02-20 18:18:13,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 39.8MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.53ms. Allocated memory is still 115.3MB. Free memory was 83.4MB in the beginning and 91.1MB in the end (delta: -7.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.46ms. Allocated memory is still 115.3MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 88.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.86ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 74.3MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2560.30ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 74.0MB in the beginning and 56.1MB in the end (delta: 17.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:18:13,660 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_max_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:18:15,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:18:15,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:18:15,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:18:15,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:18:15,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:18:15,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:18:15,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:18:15,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:18:15,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:18:15,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:18:15,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:18:15,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:18:15,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:18:15,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:18:15,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:18:15,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:18:15,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:18:15,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:18:15,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:18:15,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:18:15,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:18:15,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:18:15,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:18:15,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:18:15,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:18:15,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:18:15,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:18:15,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:18:15,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:18:15,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:18:15,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:18:15,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:18:15,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:18:15,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:18:15,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:18:15,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:18:15,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:18:15,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:18:15,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:18:15,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:18:15,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 18:18:15,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:18:15,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:18:15,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:18:15,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:18:15,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:18:15,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:18:15,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:18:15,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:18:15,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:18:15,697 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:18:15,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:15,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:18:15,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:18:15,699 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:18:15,699 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:18:15,699 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:18:15,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:18:15,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:18:15,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:18:15,702 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f [2022-02-20 18:18:16,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:18:16,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:18:16,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:18:16,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:18:16,038 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:18:16,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max_incorrect.c [2022-02-20 18:18:16,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28719dc1b/d8e745f95ce9433b80175f9484b80d90/FLAGbd35c7e7d [2022-02-20 18:18:16,534 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:18:16,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c [2022-02-20 18:18:16,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28719dc1b/d8e745f95ce9433b80175f9484b80d90/FLAGbd35c7e7d [2022-02-20 18:18:16,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28719dc1b/d8e745f95ce9433b80175f9484b80d90 [2022-02-20 18:18:16,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:18:16,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:18:16,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:16,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:18:16,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:18:16,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459f3a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16, skipping insertion in model container [2022-02-20 18:18:16,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:18:16,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:18:16,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2022-02-20 18:18:16,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:16,756 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:18:16,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:18:16,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2022-02-20 18:18:16,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:16,809 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:18:16,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2022-02-20 18:18:16,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:18:16,850 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:18:16,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16 WrapperNode [2022-02-20 18:18:16,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:18:16,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:16,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:18:16,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:18:16,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,893 INFO L137 Inliner]: procedures = 25, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2022-02-20 18:18:16,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:18:16,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:18:16,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:18:16,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:18:16,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:18:16,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:18:16,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:18:16,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:18:16,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (1/1) ... [2022-02-20 18:18:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:18:16,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:18:16,973 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-20 18:18:16,992 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-20 18:18:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 18:18:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:18:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-02-20 18:18:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-02-20 18:18:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-02-20 18:18:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-02-20 18:18:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:18:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-02-20 18:18:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-02-20 18:18:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 18:18:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 18:18:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 18:18:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:18:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:18:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 18:18:17,121 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:18:17,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:18:17,337 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:18:17,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:18:17,344 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:18:17,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:17 BoogieIcfgContainer [2022-02-20 18:18:17,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:18:17,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:18:17,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:18:17,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:18:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:18:16" (1/3) ... [2022-02-20 18:18:17,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352b2fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:17, skipping insertion in model container [2022-02-20 18:18:17,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:18:16" (2/3) ... [2022-02-20 18:18:17,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352b2fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:18:17, skipping insertion in model container [2022-02-20 18:18:17,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:18:17" (3/3) ... [2022-02-20 18:18:17,355 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2022-02-20 18:18:17,359 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:18:17,359 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:18:17,398 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:18:17,404 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:18:17,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:18:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:18:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 18:18:17,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:17,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:18:17,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -891537794, now seen corresponding path program 1 times [2022-02-20 18:18:17,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:18:17,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41815245] [2022-02-20 18:18:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:18:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:18:17,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:18:17,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 18:18:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:17,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 18:18:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:17,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:18:17,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {43#true} is VALID [2022-02-20 18:18:17,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret19#1.base, main_#t~ret19#1.offset; {43#true} is VALID [2022-02-20 18:18:17,913 INFO L272 TraceCheckUtils]: 2: Hoare triple {43#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := nondet_tree(); {43#true} is VALID [2022-02-20 18:18:17,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {43#true} assume 0bv8 != #t~nondet5;havoc #t~nondet5;#res.base, #res.offset := 0bv32, 0bv32; {57#(and (= |nondet_tree_#res.base| (_ bv0 32)) (= |nondet_tree_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#(and (= |nondet_tree_#res.base| (_ bv0 32)) (= |nondet_tree_#res.offset| (_ bv0 32)))} assume true; {57#(and (= |nondet_tree_#res.base| (_ bv0 32)) (= |nondet_tree_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,916 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57#(and (= |nondet_tree_#res.base| (_ bv0 32)) (= |nondet_tree_#res.offset| (_ bv0 32)))} {43#true} #72#return; {64#(and (= |ULTIMATE.start_main_#t~ret19#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_#t~ret19#1.offset|))} is VALID [2022-02-20 18:18:17,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {64#(and (= |ULTIMATE.start_main_#t~ret19#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_#t~ret19#1.offset|))} assume { :begin_inline_task } true;task_#in~n#1.base, task_#in~n#1.offset := main_#t~ret19#1.base, main_#t~ret19#1.offset;havoc task_#t~ret18#1, task_~n#1.base, task_~n#1.offset, task_~a~1#1;task_~n#1.base, task_~n#1.offset := task_#in~n#1.base, task_#in~n#1.offset; {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,917 INFO L272 TraceCheckUtils]: 7: Hoare triple {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} call task_#t~ret18#1 := max(task_~n#1.base, task_~n#1.offset); {43#true} is VALID [2022-02-20 18:18:17,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2022-02-20 18:18:17,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {43#true} is VALID [2022-02-20 18:18:17,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#true} assume true; {43#true} is VALID [2022-02-20 18:18:17,918 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {43#true} {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} #74#return; {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} task_~a~1#1 := task_#t~ret18#1;havoc task_#t~ret18#1; {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,920 INFO L272 TraceCheckUtils]: 13: Hoare triple {68#(and (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)) (= |ULTIMATE.start_task_~n#1.offset| (_ bv0 32)))} call check(task_~n#1.base, task_~n#1.offset, task_~a~1#1); {90#(and (= |check_#in~n#1.base| (_ bv0 32)) (= |check_#in~n#1.offset| (_ bv0 32)))} is VALID [2022-02-20 18:18:17,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#(and (= |check_#in~n#1.base| (_ bv0 32)) (= |check_#in~n#1.offset| (_ bv0 32)))} ~n#1.base, ~n#1.offset := #in~n#1.base, #in~n#1.offset;~a#1 := #in~a#1; {94#(and (= |check_~n#1.base| (_ bv0 32)) (= (_ bv0 32) |check_~n#1.offset|))} is VALID [2022-02-20 18:18:17,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {94#(and (= |check_~n#1.base| (_ bv0 32)) (= (_ bv0 32) |check_~n#1.offset|))} assume ~n#1.base != 0bv32 || ~n#1.offset != 0bv32;call #t~mem14#1 := read~intINTTYPE4(~n#1.base, ~n#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle32(#t~mem14#1, ~a#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {44#false} is VALID [2022-02-20 18:18:17,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {44#false} is VALID [2022-02-20 18:18:17,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 18:18:17,923 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-20 18:18:17,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:18:17,924 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:18:17,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41815245] [2022-02-20 18:18:17,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41815245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:17,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:17,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:18:17,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812833264] [2022-02-20 18:18:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 18:18:17,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:17,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:17,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:17,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:18:17,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:18:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:18:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:18:17,985 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:18,396 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-02-20 18:18:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:18:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 18:18:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2022-02-20 18:18:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2022-02-20 18:18:18,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 96 transitions. [2022-02-20 18:18:18,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:18,513 INFO L225 Difference]: With dead ends: 73 [2022-02-20 18:18:18,514 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 18:18:18,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:18:18,519 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:18,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 277 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:18:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 18:18:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 18:18:18,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:18,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:18,543 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:18,544 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:18,548 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 18:18:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:18,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:18,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:18,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Second operand 34 states. [2022-02-20 18:18:18,550 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Second operand 34 states. [2022-02-20 18:18:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:18,562 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 18:18:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:18,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:18,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:18,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:18,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:18:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-02-20 18:18:18,567 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2022-02-20 18:18:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:18,570 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-02-20 18:18:18,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:18:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 18:18:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:18:18,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:18,572 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 18:18:18,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:18:18,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:18:18,781 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1509693249, now seen corresponding path program 1 times [2022-02-20 18:18:18,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:18:18,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593202944] [2022-02-20 18:18:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:18,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:18:18,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:18:18,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:18:18,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 18:18:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:18,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:18:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:18:18,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:18:19,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {312#true} is VALID [2022-02-20 18:18:19,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret19#1.base, main_#t~ret19#1.offset; {312#true} is VALID [2022-02-20 18:18:19,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {312#true} call main_#t~ret19#1.base, main_#t~ret19#1.offset := nondet_tree(); {312#true} is VALID [2022-02-20 18:18:19,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} assume !(0bv8 != #t~nondet5);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(#t~nondet7, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet7; {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2022-02-20 18:18:19,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := nondet_tree(); {312#true} is VALID [2022-02-20 18:18:19,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} assume 0bv8 != #t~nondet5;havoc #t~nondet5;#res.base, #res.offset := 0bv32, 0bv32; {312#true} is VALID [2022-02-20 18:18:19,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 18:18:19,009 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {312#true} {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #68#return; {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2022-02-20 18:18:19,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret8.base, #t~ret8.offset; {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2022-02-20 18:18:19,010 INFO L272 TraceCheckUtils]: 9: Hoare triple {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret9.base, #t~ret9.offset := nondet_tree(); {312#true} is VALID [2022-02-20 18:18:19,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#true} assume 0bv8 != #t~nondet5;havoc #t~nondet5;#res.base, #res.offset := 0bv32, 0bv32; {312#true} is VALID [2022-02-20 18:18:19,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#true} assume true; {312#true} is VALID [2022-02-20 18:18:19,011 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {312#true} {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #70#return; {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2022-02-20 18:18:19,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret9.base, #t~ret9.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret9.base, #t~ret9.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {357#(not (= |nondet_tree_#res.base| (_ bv0 32)))} is VALID [2022-02-20 18:18:19,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#(not (= |nondet_tree_#res.base| (_ bv0 32)))} assume true; {357#(not (= |nondet_tree_#res.base| (_ bv0 32)))} is VALID [2022-02-20 18:18:19,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#(not (= |nondet_tree_#res.base| (_ bv0 32)))} {312#true} #72#return; {364#(not (= |ULTIMATE.start_main_#t~ret19#1.base| (_ bv0 32)))} is VALID [2022-02-20 18:18:19,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#(not (= |ULTIMATE.start_main_#t~ret19#1.base| (_ bv0 32)))} assume { :begin_inline_task } true;task_#in~n#1.base, task_#in~n#1.offset := main_#t~ret19#1.base, main_#t~ret19#1.offset;havoc task_#t~ret18#1, task_~n#1.base, task_~n#1.offset, task_~a~1#1;task_~n#1.base, task_~n#1.offset := task_#in~n#1.base, task_#in~n#1.offset; {368#(not (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)))} is VALID [2022-02-20 18:18:19,013 INFO L272 TraceCheckUtils]: 17: Hoare triple {368#(not (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)))} call task_#t~ret18#1 := max(task_~n#1.base, task_~n#1.offset); {312#true} is VALID [2022-02-20 18:18:19,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {312#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {375#(= |max_#in~n.base| max_~n.base)} is VALID [2022-02-20 18:18:19,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {375#(= |max_#in~n.base| max_~n.base)} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {379#(= |max_#in~n.base| (_ bv0 32))} is VALID [2022-02-20 18:18:19,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {379#(= |max_#in~n.base| (_ bv0 32))} assume true; {379#(= |max_#in~n.base| (_ bv0 32))} is VALID [2022-02-20 18:18:19,015 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {379#(= |max_#in~n.base| (_ bv0 32))} {368#(not (= |ULTIMATE.start_task_~n#1.base| (_ bv0 32)))} #74#return; {313#false} is VALID [2022-02-20 18:18:19,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {313#false} task_~a~1#1 := task_#t~ret18#1;havoc task_#t~ret18#1; {313#false} is VALID [2022-02-20 18:18:19,016 INFO L272 TraceCheckUtils]: 23: Hoare triple {313#false} call check(task_~n#1.base, task_~n#1.offset, task_~a~1#1); {313#false} is VALID [2022-02-20 18:18:19,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {313#false} ~n#1.base, ~n#1.offset := #in~n#1.base, #in~n#1.offset;~a#1 := #in~a#1; {313#false} is VALID [2022-02-20 18:18:19,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {313#false} assume ~n#1.base != 0bv32 || ~n#1.offset != 0bv32;call #t~mem14#1 := read~intINTTYPE4(~n#1.base, ~n#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsle32(#t~mem14#1, ~a#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {313#false} is VALID [2022-02-20 18:18:19,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {313#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {313#false} is VALID [2022-02-20 18:18:19,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:18:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 18:18:19,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:18:19,017 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:18:19,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593202944] [2022-02-20 18:18:19,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593202944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:18:19,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:18:19,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:18:19,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208956425] [2022-02-20 18:18:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:18:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 18:18:19,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:18:19,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:19,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:19,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:18:19,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:18:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:18:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:18:19,050 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:19,579 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-02-20 18:18:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:18:19,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 18:18:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:18:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 18:18:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-02-20 18:18:19,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-02-20 18:18:19,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:18:19,675 INFO L225 Difference]: With dead ends: 47 [2022-02-20 18:18:19,675 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 18:18:19,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:18:19,676 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:18:19,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:18:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 18:18:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 18:18:19,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:18:19,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:19,688 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:19,688 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:19,690 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 18:18:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:19,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:19,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:19,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Second operand 36 states. [2022-02-20 18:18:19,692 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Second operand 36 states. [2022-02-20 18:18:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:18:19,694 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 18:18:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:19,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:18:19,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:18:19,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:18:19,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:18:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 18:18:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-02-20 18:18:19,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 28 [2022-02-20 18:18:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:18:19,698 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-02-20 18:18:19,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 18:18:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 18:18:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:18:19,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:18:19,700 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] [2022-02-20 18:18:19,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 18:18:19,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:18:19,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:18:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:18:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -896236761, now seen corresponding path program 1 times [2022-02-20 18:18:19,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:18:19,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761764854] [2022-02-20 18:18:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:18:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:18:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:18:19,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:18:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 18:18:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:18:20,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:18:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:18:20,142 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:18:20,143 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:18:20,144 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location checkErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:18:20,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:18:20,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:18:20,381 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 18:18:20,384 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:18:20,399 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret19 := nondet_tree(); [2022-02-20 18:18:20,400 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:18:20,403 INFO L158 Benchmark]: Toolchain (without parser) took 3839.63ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 29.5MB in the beginning and 41.2MB in the end (delta: -11.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,404 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:18:20,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.92ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 48.8MB in the end (delta: -19.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 46.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,405 INFO L158 Benchmark]: Boogie Preprocessor took 47.32ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,406 INFO L158 Benchmark]: RCFGBuilder took 403.79ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 47.2MB in the end (delta: -2.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,408 INFO L158 Benchmark]: TraceAbstraction took 3053.83ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 46.7MB in the beginning and 41.2MB in the end (delta: 5.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-02-20 18:18:20,409 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.92ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.3MB in the beginning and 48.8MB in the end (delta: -19.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 46.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.32ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.79ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 47.2MB in the end (delta: -2.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3053.83ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 46.7MB in the beginning and 41.2MB in the end (delta: 5.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:18:20,439 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator