./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_del_rec_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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ab962fe7228ac89b10b808ceccbcc2ec1ea47fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_del_rec_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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ab962fe7228ac89b10b808ceccbcc2ec1ea47fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:13:45,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:45,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:45,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:45,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:45,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:45,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:45,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:45,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:45,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:45,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:45,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:45,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:45,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:45,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:45,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:45,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:45,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:45,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:45,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:45,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:45,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:45,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:45,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:45,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:45,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:45,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:45,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:45,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:45,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:45,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:45,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:45,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:45,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:45,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:45,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:45,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:45,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:45,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:45,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:45,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:45,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:13:45,724 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:45,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:45,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:45,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:45,726 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:45,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:45,727 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:45,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:13:45,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:45,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:45,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:45,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:45,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:45,729 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:45,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:45,729 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:45,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:45,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:45,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:45,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:45,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:45,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:45,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:45,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:45,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:45,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:13:45,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:13:45,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:45,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:45,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 0ab962fe7228ac89b10b808ceccbcc2ec1ea47fa [2020-07-28 19:13:46,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:46,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:46,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:46,122 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:46,123 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:46,123 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-07-28 19:13:46,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e22af652/eeaf87a9c51f420d9dbf25bcaa8a3bc6/FLAG6edb97676 [2020-07-28 19:13:46,680 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:46,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-07-28 19:13:46,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e22af652/eeaf87a9c51f420d9dbf25bcaa8a3bc6/FLAG6edb97676 [2020-07-28 19:13:47,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e22af652/eeaf87a9c51f420d9dbf25bcaa8a3bc6 [2020-07-28 19:13:47,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:47,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:47,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:47,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:47,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:47,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f922af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47, skipping insertion in model container [2020-07-28 19:13:47,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:47,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:47,283 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:13:47,287 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:13:47,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:47,330 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:47,417 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:13:47,419 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:13:47,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:47,463 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:47,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47 WrapperNode [2020-07-28 19:13:47,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:47,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:47,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:47,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:47,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:47,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:47,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:47,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:47,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... [2020-07-28 19:13:47,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:47,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:47,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:47,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:47,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 19:13:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 19:13:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-28 19:13:47,683 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-28 19:13:47,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 19:13:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-28 19:13:47,686 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-28 19:13:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 19:13:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 19:13:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-28 19:13:47,687 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-28 19:13:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 19:13:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-28 19:13:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-28 19:13:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-28 19:13:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-28 19:13:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 19:13:48,443 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:13:48,444 INFO L295 CfgBuilder]: Removed 21 assume(true) statements. [2020-07-28 19:13:48,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:48 BoogieIcfgContainer [2020-07-28 19:13:48,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:13:48,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:13:48,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:13:48,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:13:48,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:47" (1/3) ... [2020-07-28 19:13:48,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d32643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:48, skipping insertion in model container [2020-07-28 19:13:48,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:47" (2/3) ... [2020-07-28 19:13:48,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d32643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:48, skipping insertion in model container [2020-07-28 19:13:48,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:48" (3/3) ... [2020-07-28 19:13:48,459 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-07-28 19:13:48,470 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:13:48,479 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-28 19:13:48,494 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-28 19:13:48,520 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:13:48,520 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:13:48,521 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:13:48,521 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:13:48,521 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:13:48,522 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:13:48,522 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:13:48,522 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:13:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-28 19:13:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-28 19:13:48,557 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:48,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:48,559 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1095170897, now seen corresponding path program 1 times [2020-07-28 19:13:48,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:48,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773211267] [2020-07-28 19:13:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:48,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:48,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {84#true} is VALID [2020-07-28 19:13:48,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84#true} {84#true} #149#return; {84#true} is VALID [2020-07-28 19:13:48,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-28 19:13:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:48,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {84#true} is VALID [2020-07-28 19:13:48,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {84#true} is VALID [2020-07-28 19:13:48,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,842 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #151#return; {84#true} is VALID [2020-07-28 19:13:48,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-28 19:13:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:48,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {84#true} is VALID [2020-07-28 19:13:48,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {84#true} is VALID [2020-07-28 19:13:48,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #153#return; {84#true} is VALID [2020-07-28 19:13:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-07-28 19:13:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:48,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {102#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {84#true} is VALID [2020-07-28 19:13:48,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {84#true} is VALID [2020-07-28 19:13:48,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {85#false} #155#return; {85#false} is VALID [2020-07-28 19:13:48,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-28 19:13:48,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {84#true} is VALID [2020-07-28 19:13:48,890 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {101#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:48,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {84#true} is VALID [2020-07-28 19:13:48,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,891 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #149#return; {84#true} is VALID [2020-07-28 19:13:48,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {84#true} is VALID [2020-07-28 19:13:48,892 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:13:48,893 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {84#true} is VALID [2020-07-28 19:13:48,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {84#true} is VALID [2020-07-28 19:13:48,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,894 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {84#true} {84#true} #151#return; {84#true} is VALID [2020-07-28 19:13:48,895 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {84#true} is VALID [2020-07-28 19:13:48,895 INFO L263 TraceCheckUtils]: 13: Hoare triple {84#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:13:48,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {84#true} is VALID [2020-07-28 19:13:48,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {84#true} is VALID [2020-07-28 19:13:48,901 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,902 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {84#true} {84#true} #153#return; {84#true} is VALID [2020-07-28 19:13:48,902 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {84#true} is VALID [2020-07-28 19:13:48,904 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} assume 0 == assume_abort_if_not_~cond;assume false; {85#false} is VALID [2020-07-28 19:13:48,904 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {85#false} is VALID [2020-07-28 19:13:48,905 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {85#false} is VALID [2020-07-28 19:13:48,905 INFO L263 TraceCheckUtils]: 22: Hoare triple {85#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {102#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:48,905 INFO L280 TraceCheckUtils]: 23: Hoare triple {102#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {84#true} is VALID [2020-07-28 19:13:48,906 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {84#true} is VALID [2020-07-28 19:13:48,906 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:13:48,906 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {84#true} {85#false} #155#return; {85#false} is VALID [2020-07-28 19:13:48,907 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {85#false} is VALID [2020-07-28 19:13:48,908 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume 0 == __VERIFIER_assert_~cond; {85#false} is VALID [2020-07-28 19:13:48,909 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-28 19:13:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:13:48,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773211267] [2020-07-28 19:13:48,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:48,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 19:13:48,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251505782] [2020-07-28 19:13:48,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-28 19:13:48,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:48,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 19:13:49,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:49,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 19:13:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 19:13:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 19:13:49,025 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2020-07-28 19:13:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:49,734 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2020-07-28 19:13:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 19:13:49,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-28 19:13:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 19:13:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2020-07-28 19:13:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 19:13:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2020-07-28 19:13:49,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2020-07-28 19:13:50,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:50,144 INFO L225 Difference]: With dead ends: 142 [2020-07-28 19:13:50,145 INFO L226 Difference]: Without dead ends: 81 [2020-07-28 19:13:50,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 19:13:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-28 19:13:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-07-28 19:13:50,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:50,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 76 states. [2020-07-28 19:13:50,225 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 76 states. [2020-07-28 19:13:50,225 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 76 states. [2020-07-28 19:13:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:50,237 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2020-07-28 19:13:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2020-07-28 19:13:50,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:50,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:50,241 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 81 states. [2020-07-28 19:13:50,241 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 81 states. [2020-07-28 19:13:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:50,251 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2020-07-28 19:13:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2020-07-28 19:13:50,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:50,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:50,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:50,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-28 19:13:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2020-07-28 19:13:50,264 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 30 [2020-07-28 19:13:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:50,265 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2020-07-28 19:13:50,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 19:13:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-28 19:13:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-28 19:13:50,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:50,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:50,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:13:50,272 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash -394106319, now seen corresponding path program 1 times [2020-07-28 19:13:50,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:50,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431523848] [2020-07-28 19:13:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:50,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:50,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {542#true} is VALID [2020-07-28 19:13:50,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,417 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #149#return; {542#true} is VALID [2020-07-28 19:13:50,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-28 19:13:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:50,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {542#true} is VALID [2020-07-28 19:13:50,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {542#true} is VALID [2020-07-28 19:13:50,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,424 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #151#return; {542#true} is VALID [2020-07-28 19:13:50,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-28 19:13:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:50,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {542#true} is VALID [2020-07-28 19:13:50,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} is VALID [2020-07-28 19:13:50,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} assume true; {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} is VALID [2020-07-28 19:13:50,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} {542#true} #153#return; {555#(= 0 |ULTIMATE.start_task_#t~ret26|)} is VALID [2020-07-28 19:13:50,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-07-28 19:13:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:50,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {563#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {542#true} is VALID [2020-07-28 19:13:50,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {542#true} is VALID [2020-07-28 19:13:50,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,479 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {542#true} {543#false} #155#return; {543#false} is VALID [2020-07-28 19:13:50,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {542#true} is VALID [2020-07-28 19:13:50,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {542#true} is VALID [2020-07-28 19:13:50,482 INFO L263 TraceCheckUtils]: 2: Hoare triple {542#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {561#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:50,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {561#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {542#true} is VALID [2020-07-28 19:13:50,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,483 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {542#true} {542#true} #149#return; {542#true} is VALID [2020-07-28 19:13:50,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {542#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {542#true} is VALID [2020-07-28 19:13:50,483 INFO L263 TraceCheckUtils]: 7: Hoare triple {542#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {542#true} is VALID [2020-07-28 19:13:50,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {542#true} is VALID [2020-07-28 19:13:50,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {542#true} is VALID [2020-07-28 19:13:50,484 INFO L280 TraceCheckUtils]: 10: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,485 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {542#true} {542#true} #151#return; {542#true} is VALID [2020-07-28 19:13:50,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {542#true} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {542#true} is VALID [2020-07-28 19:13:50,485 INFO L263 TraceCheckUtils]: 13: Hoare triple {542#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {542#true} is VALID [2020-07-28 19:13:50,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {542#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {542#true} is VALID [2020-07-28 19:13:50,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {542#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} is VALID [2020-07-28 19:13:50,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} assume true; {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} is VALID [2020-07-28 19:13:50,489 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {562#(and (<= 0 |size_#res|) (<= |size_#res| 0))} {542#true} #153#return; {555#(= 0 |ULTIMATE.start_task_#t~ret26|)} is VALID [2020-07-28 19:13:50,490 INFO L280 TraceCheckUtils]: 18: Hoare triple {555#(= 0 |ULTIMATE.start_task_#t~ret26|)} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {556#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-28 19:13:50,491 INFO L280 TraceCheckUtils]: 19: Hoare triple {556#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {543#false} is VALID [2020-07-28 19:13:50,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {543#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {543#false} is VALID [2020-07-28 19:13:50,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {543#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {543#false} is VALID [2020-07-28 19:13:50,492 INFO L263 TraceCheckUtils]: 22: Hoare triple {543#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {563#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:50,492 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {542#true} is VALID [2020-07-28 19:13:50,493 INFO L280 TraceCheckUtils]: 24: Hoare triple {542#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {542#true} is VALID [2020-07-28 19:13:50,493 INFO L280 TraceCheckUtils]: 25: Hoare triple {542#true} assume true; {542#true} is VALID [2020-07-28 19:13:50,493 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {542#true} {543#false} #155#return; {543#false} is VALID [2020-07-28 19:13:50,493 INFO L280 TraceCheckUtils]: 27: Hoare triple {543#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {543#false} is VALID [2020-07-28 19:13:50,494 INFO L280 TraceCheckUtils]: 28: Hoare triple {543#false} assume 0 == __VERIFIER_assert_~cond; {543#false} is VALID [2020-07-28 19:13:50,494 INFO L280 TraceCheckUtils]: 29: Hoare triple {543#false} assume !false; {543#false} is VALID [2020-07-28 19:13:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:13:50,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431523848] [2020-07-28 19:13:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:50,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 19:13:50,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673189908] [2020-07-28 19:13:50,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-28 19:13:50,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:50,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:13:50,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:50,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:13:50,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:13:50,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:13:50,541 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 7 states. [2020-07-28 19:13:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:51,646 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2020-07-28 19:13:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:13:51,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-28 19:13:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2020-07-28 19:13:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2020-07-28 19:13:51,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 170 transitions. [2020-07-28 19:13:51,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:51,920 INFO L225 Difference]: With dead ends: 136 [2020-07-28 19:13:51,920 INFO L226 Difference]: Without dead ends: 83 [2020-07-28 19:13:51,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:13:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-28 19:13:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-07-28 19:13:51,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:51,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 78 states. [2020-07-28 19:13:51,957 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 78 states. [2020-07-28 19:13:51,957 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 78 states. [2020-07-28 19:13:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:51,964 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2020-07-28 19:13:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2020-07-28 19:13:51,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:51,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:51,966 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 83 states. [2020-07-28 19:13:51,966 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 83 states. [2020-07-28 19:13:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:51,972 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2020-07-28 19:13:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2020-07-28 19:13:51,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:51,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:51,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:51,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-28 19:13:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2020-07-28 19:13:51,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 30 [2020-07-28 19:13:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:51,979 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2020-07-28 19:13:51,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:13:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-07-28 19:13:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-28 19:13:51,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:51,981 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:51,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:13:51,982 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1904559170, now seen corresponding path program 1 times [2020-07-28 19:13:51,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:51,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586612009] [2020-07-28 19:13:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {1036#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,115 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1005#true} #149#return; {1010#(and (= 0 |ULTIMATE.start_main_#t~ret38.base|) (= 0 |ULTIMATE.start_main_#t~ret38.offset|))} is VALID [2020-07-28 19:13:52,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-28 19:13:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1005#true} is VALID [2020-07-28 19:13:52,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1005#true} is VALID [2020-07-28 19:13:52,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,129 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #151#return; {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-07-28 19:13:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #145#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-28 19:13:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,243 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #147#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-28 19:13:52,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,245 INFO L263 TraceCheckUtils]: 2: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1005#true} is VALID [2020-07-28 19:13:52,245 INFO L280 TraceCheckUtils]: 3: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,248 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #145#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,249 INFO L263 TraceCheckUtils]: 8: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1005#true} is VALID [2020-07-28 19:13:52,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,250 INFO L280 TraceCheckUtils]: 11: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,251 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #147#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,253 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,272 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #153#return; {1006#false} is VALID [2020-07-28 19:13:52,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-28 19:13:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {1048#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1005#true} is VALID [2020-07-28 19:13:52,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1005#true} is VALID [2020-07-28 19:13:52,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1006#false} #155#return; {1006#false} is VALID [2020-07-28 19:13:52,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1005#true} is VALID [2020-07-28 19:13:52,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1005#true} is VALID [2020-07-28 19:13:52,301 INFO L263 TraceCheckUtils]: 2: Hoare triple {1005#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1036#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:52,306 INFO L280 TraceCheckUtils]: 3: Hoare triple {1036#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,310 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1005#true} #149#return; {1010#(and (= 0 |ULTIMATE.start_main_#t~ret38.base|) (= 0 |ULTIMATE.start_main_#t~ret38.offset|))} is VALID [2020-07-28 19:13:52,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {1010#(and (= 0 |ULTIMATE.start_main_#t~ret38.base|) (= 0 |ULTIMATE.start_main_#t~ret38.offset|))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,311 INFO L263 TraceCheckUtils]: 7: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1005#true} is VALID [2020-07-28 19:13:52,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {1005#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1005#true} is VALID [2020-07-28 19:13:52,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1005#true} is VALID [2020-07-28 19:13:52,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,312 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1005#true} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #151#return; {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,313 INFO L280 TraceCheckUtils]: 12: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,313 INFO L263 TraceCheckUtils]: 13: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1005#true} is VALID [2020-07-28 19:13:52,314 INFO L280 TraceCheckUtils]: 14: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-28 19:13:52,315 INFO L280 TraceCheckUtils]: 15: Hoare triple {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,315 INFO L263 TraceCheckUtils]: 16: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1005#true} is VALID [2020-07-28 19:13:52,316 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,316 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,316 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,317 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #145#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,318 INFO L280 TraceCheckUtils]: 21: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,318 INFO L263 TraceCheckUtils]: 22: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1005#true} is VALID [2020-07-28 19:13:52,318 INFO L280 TraceCheckUtils]: 23: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,319 INFO L280 TraceCheckUtils]: 24: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,319 INFO L280 TraceCheckUtils]: 25: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,320 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #147#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,320 INFO L280 TraceCheckUtils]: 27: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,321 INFO L280 TraceCheckUtils]: 28: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,323 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #153#return; {1006#false} is VALID [2020-07-28 19:13:52,323 INFO L280 TraceCheckUtils]: 30: Hoare triple {1006#false} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1006#false} is VALID [2020-07-28 19:13:52,323 INFO L280 TraceCheckUtils]: 31: Hoare triple {1006#false} assume !(0 == assume_abort_if_not_~cond); {1006#false} is VALID [2020-07-28 19:13:52,323 INFO L280 TraceCheckUtils]: 32: Hoare triple {1006#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1006#false} is VALID [2020-07-28 19:13:52,324 INFO L280 TraceCheckUtils]: 33: Hoare triple {1006#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1006#false} is VALID [2020-07-28 19:13:52,324 INFO L263 TraceCheckUtils]: 34: Hoare triple {1006#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1048#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:52,324 INFO L280 TraceCheckUtils]: 35: Hoare triple {1048#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1005#true} is VALID [2020-07-28 19:13:52,324 INFO L280 TraceCheckUtils]: 36: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1005#true} is VALID [2020-07-28 19:13:52,325 INFO L280 TraceCheckUtils]: 37: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,325 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1005#true} {1006#false} #155#return; {1006#false} is VALID [2020-07-28 19:13:52,325 INFO L280 TraceCheckUtils]: 39: Hoare triple {1006#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1006#false} is VALID [2020-07-28 19:13:52,325 INFO L280 TraceCheckUtils]: 40: Hoare triple {1006#false} assume 0 == __VERIFIER_assert_~cond; {1006#false} is VALID [2020-07-28 19:13:52,326 INFO L280 TraceCheckUtils]: 41: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2020-07-28 19:13:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 19:13:52,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586612009] [2020-07-28 19:13:52,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205500918] [2020-07-28 19:13:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:13:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-28 19:13:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:52,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1005#true} is VALID [2020-07-28 19:13:52,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1005#true} is VALID [2020-07-28 19:13:52,638 INFO L263 TraceCheckUtils]: 2: Hoare triple {1005#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1005#true} is VALID [2020-07-28 19:13:52,640 INFO L280 TraceCheckUtils]: 3: Hoare triple {1005#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,642 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1037#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1005#true} #149#return; {1010#(and (= 0 |ULTIMATE.start_main_#t~ret38.base|) (= 0 |ULTIMATE.start_main_#t~ret38.offset|))} is VALID [2020-07-28 19:13:52,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {1010#(and (= 0 |ULTIMATE.start_main_#t~ret38.base|) (= 0 |ULTIMATE.start_main_#t~ret38.offset|))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,644 INFO L263 TraceCheckUtils]: 7: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1005#true} is VALID [2020-07-28 19:13:52,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {1005#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1005#true} is VALID [2020-07-28 19:13:52,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1005#true} is VALID [2020-07-28 19:13:52,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,646 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1005#true} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #151#return; {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:13:52,648 INFO L263 TraceCheckUtils]: 13: Hoare triple {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1005#true} is VALID [2020-07-28 19:13:52,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-28 19:13:52,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {1038#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,651 INFO L263 TraceCheckUtils]: 16: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1005#true} is VALID [2020-07-28 19:13:52,651 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,653 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #145#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,654 INFO L263 TraceCheckUtils]: 22: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1005#true} is VALID [2020-07-28 19:13:52,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {1005#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1005#true} is VALID [2020-07-28 19:13:52,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {1005#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1005#true} is VALID [2020-07-28 19:13:52,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-28 19:13:52,657 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1005#true} {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #147#return; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,658 INFO L280 TraceCheckUtils]: 27: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,658 INFO L280 TraceCheckUtils]: 28: Hoare triple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:52,660 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1039#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1011#(and (= 0 ULTIMATE.start_task_~t.base) (= 0 ULTIMATE.start_task_~t.offset))} #153#return; {1006#false} is VALID [2020-07-28 19:13:52,660 INFO L280 TraceCheckUtils]: 30: Hoare triple {1006#false} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1006#false} is VALID [2020-07-28 19:13:52,660 INFO L280 TraceCheckUtils]: 31: Hoare triple {1006#false} assume !(0 == assume_abort_if_not_~cond); {1006#false} is VALID [2020-07-28 19:13:52,661 INFO L280 TraceCheckUtils]: 32: Hoare triple {1006#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1006#false} is VALID [2020-07-28 19:13:52,661 INFO L280 TraceCheckUtils]: 33: Hoare triple {1006#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1006#false} is VALID [2020-07-28 19:13:52,661 INFO L263 TraceCheckUtils]: 34: Hoare triple {1006#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1006#false} is VALID [2020-07-28 19:13:52,662 INFO L280 TraceCheckUtils]: 35: Hoare triple {1006#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1006#false} is VALID [2020-07-28 19:13:52,662 INFO L280 TraceCheckUtils]: 36: Hoare triple {1006#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1006#false} is VALID [2020-07-28 19:13:52,662 INFO L280 TraceCheckUtils]: 37: Hoare triple {1006#false} assume true; {1006#false} is VALID [2020-07-28 19:13:52,662 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1006#false} {1006#false} #155#return; {1006#false} is VALID [2020-07-28 19:13:52,663 INFO L280 TraceCheckUtils]: 39: Hoare triple {1006#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1006#false} is VALID [2020-07-28 19:13:52,663 INFO L280 TraceCheckUtils]: 40: Hoare triple {1006#false} assume 0 == __VERIFIER_assert_~cond; {1006#false} is VALID [2020-07-28 19:13:52,663 INFO L280 TraceCheckUtils]: 41: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2020-07-28 19:13:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 19:13:52,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:13:52,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2020-07-28 19:13:52,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243274115] [2020-07-28 19:13:52,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-07-28 19:13:52,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:52,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:13:52,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:52,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:13:52,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:13:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:13:52,732 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 9 states. [2020-07-28 19:13:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,380 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-07-28 19:13:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:13:54,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-07-28 19:13:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:13:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-28 19:13:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:13:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-28 19:13:54,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 175 transitions. [2020-07-28 19:13:54,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:54,662 INFO L225 Difference]: With dead ends: 142 [2020-07-28 19:13:54,663 INFO L226 Difference]: Without dead ends: 83 [2020-07-28 19:13:54,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-07-28 19:13:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-28 19:13:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-07-28 19:13:54,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:54,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 80 states. [2020-07-28 19:13:54,705 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 80 states. [2020-07-28 19:13:54,705 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 80 states. [2020-07-28 19:13:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,718 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2020-07-28 19:13:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2020-07-28 19:13:54,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:54,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:54,722 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 83 states. [2020-07-28 19:13:54,722 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 83 states. [2020-07-28 19:13:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:54,732 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2020-07-28 19:13:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2020-07-28 19:13:54,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:54,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:54,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:54,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-28 19:13:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2020-07-28 19:13:54,743 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 42 [2020-07-28 19:13:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:54,746 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2020-07-28 19:13:54,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:13:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-07-28 19:13:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-28 19:13:54,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:54,752 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:54,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:13:54,966 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1838253317, now seen corresponding path program 1 times [2020-07-28 19:13:54,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:54,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424418515] [2020-07-28 19:13:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:13:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-28 19:13:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,194 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #137#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,200 INFO L263 TraceCheckUtils]: 1: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,200 INFO L280 TraceCheckUtils]: 3: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,204 INFO L280 TraceCheckUtils]: 5: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,205 INFO L263 TraceCheckUtils]: 6: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,207 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #137#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:55,208 INFO L280 TraceCheckUtils]: 11: Hoare triple {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:55,210 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1630#true} #149#return; {1645#(not (= 0 |ULTIMATE.start_main_#t~ret38.base|))} is VALID [2020-07-28 19:13:55,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-07-28 19:13:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1680#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {1680#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1681#(= 0 |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {1681#(= 0 |min_#in~n.base|)} assume true; {1681#(= 0 |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,255 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1681#(= 0 |min_#in~n.base|)} {1646#(not (= 0 ULTIMATE.start_task_~t.base))} #151#return; {1631#false} is VALID [2020-07-28 19:13:55,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-07-28 19:13:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1630#true} #145#return; {1630#true} is VALID [2020-07-28 19:13:55,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-28 19:13:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1630#true} #147#return; {1630#true} is VALID [2020-07-28 19:13:55,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1630#true} is VALID [2020-07-28 19:13:55,294 INFO L263 TraceCheckUtils]: 2: Hoare triple {1630#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1630#true} is VALID [2020-07-28 19:13:55,295 INFO L280 TraceCheckUtils]: 3: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,295 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1630#true} {1630#true} #145#return; {1630#true} is VALID [2020-07-28 19:13:55,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {1630#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1630#true} is VALID [2020-07-28 19:13:55,296 INFO L263 TraceCheckUtils]: 8: Hoare triple {1630#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1630#true} is VALID [2020-07-28 19:13:55,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,297 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1630#true} {1630#true} #147#return; {1630#true} is VALID [2020-07-28 19:13:55,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {1630#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1630#true} is VALID [2020-07-28 19:13:55,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,298 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1630#true} {1631#false} #153#return; {1631#false} is VALID [2020-07-28 19:13:55,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-07-28 19:13:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:55,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {1690#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1630#true} is VALID [2020-07-28 19:13:55,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1630#true} is VALID [2020-07-28 19:13:55,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,328 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1631#false} #155#return; {1631#false} is VALID [2020-07-28 19:13:55,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1630#true} is VALID [2020-07-28 19:13:55,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1630#true} is VALID [2020-07-28 19:13:55,330 INFO L263 TraceCheckUtils]: 2: Hoare triple {1630#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,334 INFO L263 TraceCheckUtils]: 4: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,336 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,338 INFO L263 TraceCheckUtils]: 9: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {1671#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1630#true} is VALID [2020-07-28 19:13:55,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,339 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1630#true} {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #137#return; {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-28 19:13:55,340 INFO L280 TraceCheckUtils]: 13: Hoare triple {1672#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:55,341 INFO L280 TraceCheckUtils]: 14: Hoare triple {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:55,342 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1679#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1630#true} #149#return; {1645#(not (= 0 |ULTIMATE.start_main_#t~ret38.base|))} is VALID [2020-07-28 19:13:55,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {1645#(not (= 0 |ULTIMATE.start_main_#t~ret38.base|))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {1646#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:55,343 INFO L263 TraceCheckUtils]: 17: Hoare triple {1646#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1630#true} is VALID [2020-07-28 19:13:55,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {1630#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1680#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {1680#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1681#(= 0 |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,346 INFO L280 TraceCheckUtils]: 20: Hoare triple {1681#(= 0 |min_#in~n.base|)} assume true; {1681#(= 0 |min_#in~n.base|)} is VALID [2020-07-28 19:13:55,348 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1681#(= 0 |min_#in~n.base|)} {1646#(not (= 0 ULTIMATE.start_task_~t.base))} #151#return; {1631#false} is VALID [2020-07-28 19:13:55,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {1631#false} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {1631#false} is VALID [2020-07-28 19:13:55,348 INFO L263 TraceCheckUtils]: 23: Hoare triple {1631#false} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1630#true} is VALID [2020-07-28 19:13:55,349 INFO L280 TraceCheckUtils]: 24: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,349 INFO L280 TraceCheckUtils]: 25: Hoare triple {1630#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1630#true} is VALID [2020-07-28 19:13:55,349 INFO L263 TraceCheckUtils]: 26: Hoare triple {1630#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1630#true} is VALID [2020-07-28 19:13:55,349 INFO L280 TraceCheckUtils]: 27: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,349 INFO L280 TraceCheckUtils]: 28: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,350 INFO L280 TraceCheckUtils]: 29: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,350 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1630#true} {1630#true} #145#return; {1630#true} is VALID [2020-07-28 19:13:55,350 INFO L280 TraceCheckUtils]: 31: Hoare triple {1630#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1630#true} is VALID [2020-07-28 19:13:55,351 INFO L263 TraceCheckUtils]: 32: Hoare triple {1630#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1630#true} is VALID [2020-07-28 19:13:55,351 INFO L280 TraceCheckUtils]: 33: Hoare triple {1630#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1630#true} is VALID [2020-07-28 19:13:55,351 INFO L280 TraceCheckUtils]: 34: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1630#true} is VALID [2020-07-28 19:13:55,351 INFO L280 TraceCheckUtils]: 35: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,351 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1630#true} {1630#true} #147#return; {1630#true} is VALID [2020-07-28 19:13:55,352 INFO L280 TraceCheckUtils]: 37: Hoare triple {1630#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1630#true} is VALID [2020-07-28 19:13:55,352 INFO L280 TraceCheckUtils]: 38: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,352 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1630#true} {1631#false} #153#return; {1631#false} is VALID [2020-07-28 19:13:55,352 INFO L280 TraceCheckUtils]: 40: Hoare triple {1631#false} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1631#false} is VALID [2020-07-28 19:13:55,352 INFO L280 TraceCheckUtils]: 41: Hoare triple {1631#false} assume !(0 == assume_abort_if_not_~cond); {1631#false} is VALID [2020-07-28 19:13:55,353 INFO L280 TraceCheckUtils]: 42: Hoare triple {1631#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1631#false} is VALID [2020-07-28 19:13:55,353 INFO L280 TraceCheckUtils]: 43: Hoare triple {1631#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1631#false} is VALID [2020-07-28 19:13:55,353 INFO L263 TraceCheckUtils]: 44: Hoare triple {1631#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1690#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:55,354 INFO L280 TraceCheckUtils]: 45: Hoare triple {1690#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1630#true} is VALID [2020-07-28 19:13:55,354 INFO L280 TraceCheckUtils]: 46: Hoare triple {1630#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1630#true} is VALID [2020-07-28 19:13:55,354 INFO L280 TraceCheckUtils]: 47: Hoare triple {1630#true} assume true; {1630#true} is VALID [2020-07-28 19:13:55,355 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1630#true} {1631#false} #155#return; {1631#false} is VALID [2020-07-28 19:13:55,355 INFO L280 TraceCheckUtils]: 49: Hoare triple {1631#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1631#false} is VALID [2020-07-28 19:13:55,355 INFO L280 TraceCheckUtils]: 50: Hoare triple {1631#false} assume 0 == __VERIFIER_assert_~cond; {1631#false} is VALID [2020-07-28 19:13:55,356 INFO L280 TraceCheckUtils]: 51: Hoare triple {1631#false} assume !false; {1631#false} is VALID [2020-07-28 19:13:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-28 19:13:55,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424418515] [2020-07-28 19:13:55,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:55,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-28 19:13:55,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47420536] [2020-07-28 19:13:55,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-28 19:13:55,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:55,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:13:55,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:55,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:13:55,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:55,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:13:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:13:55,427 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 10 states. [2020-07-28 19:13:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,081 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-07-28 19:13:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:13:57,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-07-28 19:13:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:13:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2020-07-28 19:13:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:13:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2020-07-28 19:13:57,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 171 transitions. [2020-07-28 19:13:57,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:57,340 INFO L225 Difference]: With dead ends: 142 [2020-07-28 19:13:57,340 INFO L226 Difference]: Without dead ends: 85 [2020-07-28 19:13:57,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-28 19:13:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-28 19:13:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2020-07-28 19:13:57,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:57,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 82 states. [2020-07-28 19:13:57,395 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 82 states. [2020-07-28 19:13:57,395 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 82 states. [2020-07-28 19:13:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,401 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2020-07-28 19:13:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2020-07-28 19:13:57,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:57,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:57,403 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 85 states. [2020-07-28 19:13:57,403 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 85 states. [2020-07-28 19:13:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:57,409 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2020-07-28 19:13:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2020-07-28 19:13:57,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:57,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:57,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:57,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-28 19:13:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2020-07-28 19:13:57,415 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 52 [2020-07-28 19:13:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:57,416 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2020-07-28 19:13:57,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:13:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-07-28 19:13:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-28 19:13:57,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:57,417 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:57,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 19:13:57,418 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1543692906, now seen corresponding path program 1 times [2020-07-28 19:13:57,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:57,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113596496] [2020-07-28 19:13:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:13:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,569 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #135#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-28 19:13:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #137#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,580 INFO L263 TraceCheckUtils]: 1: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,580 INFO L280 TraceCheckUtils]: 3: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,581 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #135#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,582 INFO L280 TraceCheckUtils]: 5: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,583 INFO L263 TraceCheckUtils]: 6: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,585 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #137#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:57,586 INFO L280 TraceCheckUtils]: 11: Hoare triple {2217#(= 0 |nondet_tree_#res.offset|)} assume true; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:57,587 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2217#(= 0 |nondet_tree_#res.offset|)} {2154#true} #149#return; {2169#(= 0 |ULTIMATE.start_main_#t~ret38.offset|)} is VALID [2020-07-28 19:13:57,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-07-28 19:13:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #141#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-28 19:13:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2218#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-28 19:13:57,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,658 INFO L263 TraceCheckUtils]: 2: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2154#true} is VALID [2020-07-28 19:13:57,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,660 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #141#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,661 INFO L263 TraceCheckUtils]: 8: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2154#true} is VALID [2020-07-28 19:13:57,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,663 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,664 INFO L280 TraceCheckUtils]: 14: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,665 INFO L280 TraceCheckUtils]: 15: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,667 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2170#(= 0 ULTIMATE.start_task_~t.offset)} #151#return; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-07-28 19:13:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #145#return; {2154#true} is VALID [2020-07-28 19:13:57,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-28 19:13:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,687 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #147#return; {2154#true} is VALID [2020-07-28 19:13:57,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2154#true} is VALID [2020-07-28 19:13:57,688 INFO L263 TraceCheckUtils]: 2: Hoare triple {2154#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2154#true} is VALID [2020-07-28 19:13:57,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,689 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2154#true} {2154#true} #145#return; {2154#true} is VALID [2020-07-28 19:13:57,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {2154#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2154#true} is VALID [2020-07-28 19:13:57,690 INFO L263 TraceCheckUtils]: 8: Hoare triple {2154#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2154#true} is VALID [2020-07-28 19:13:57,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,691 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2154#true} {2154#true} #147#return; {2154#true} is VALID [2020-07-28 19:13:57,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {2154#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2154#true} is VALID [2020-07-28 19:13:57,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,693 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2154#true} {2188#(not (= 0 ULTIMATE.start_task_~t.base))} #153#return; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-07-28 19:13:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {2236#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-28 19:13:57,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:57,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {2238#(= 0 |tree_inorder_#in~t.base|)} assume true; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:57,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2238#(= 0 |tree_inorder_#in~t.base|)} {2188#(not (= 0 ULTIMATE.start_task_~t.base))} #155#return; {2155#false} is VALID [2020-07-28 19:13:57,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2154#true} is VALID [2020-07-28 19:13:57,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {2154#true} is VALID [2020-07-28 19:13:57,754 INFO L263 TraceCheckUtils]: 2: Hoare triple {2154#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,756 INFO L280 TraceCheckUtils]: 3: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,757 INFO L263 TraceCheckUtils]: 4: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,758 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #135#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,760 INFO L263 TraceCheckUtils]: 9: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {2209#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:57,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,761 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #137#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:57,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:57,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {2217#(= 0 |nondet_tree_#res.offset|)} assume true; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:57,764 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2217#(= 0 |nondet_tree_#res.offset|)} {2154#true} #149#return; {2169#(= 0 |ULTIMATE.start_main_#t~ret38.offset|)} is VALID [2020-07-28 19:13:57,765 INFO L280 TraceCheckUtils]: 16: Hoare triple {2169#(= 0 |ULTIMATE.start_main_#t~ret38.offset|)} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2170#(= 0 ULTIMATE.start_task_~t.offset)} is VALID [2020-07-28 19:13:57,765 INFO L263 TraceCheckUtils]: 17: Hoare triple {2170#(= 0 ULTIMATE.start_task_~t.offset)} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {2154#true} is VALID [2020-07-28 19:13:57,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2218#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-28 19:13:57,767 INFO L280 TraceCheckUtils]: 19: Hoare triple {2218#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,767 INFO L263 TraceCheckUtils]: 20: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2154#true} is VALID [2020-07-28 19:13:57,767 INFO L280 TraceCheckUtils]: 21: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,767 INFO L280 TraceCheckUtils]: 22: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,768 INFO L280 TraceCheckUtils]: 23: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,769 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #141#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,769 INFO L280 TraceCheckUtils]: 25: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,769 INFO L263 TraceCheckUtils]: 26: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2154#true} is VALID [2020-07-28 19:13:57,770 INFO L280 TraceCheckUtils]: 27: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:57,770 INFO L280 TraceCheckUtils]: 28: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:57,770 INFO L280 TraceCheckUtils]: 29: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,771 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2154#true} {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,772 INFO L280 TraceCheckUtils]: 31: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,772 INFO L280 TraceCheckUtils]: 32: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,773 INFO L280 TraceCheckUtils]: 33: Hoare triple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-28 19:13:57,774 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2219#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2170#(= 0 ULTIMATE.start_task_~t.offset)} #151#return; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,775 INFO L280 TraceCheckUtils]: 35: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,775 INFO L263 TraceCheckUtils]: 36: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {2154#true} is VALID [2020-07-28 19:13:57,775 INFO L280 TraceCheckUtils]: 37: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,775 INFO L280 TraceCheckUtils]: 38: Hoare triple {2154#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2154#true} is VALID [2020-07-28 19:13:57,776 INFO L263 TraceCheckUtils]: 39: Hoare triple {2154#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2154#true} is VALID [2020-07-28 19:13:57,776 INFO L280 TraceCheckUtils]: 40: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,776 INFO L280 TraceCheckUtils]: 41: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L280 TraceCheckUtils]: 42: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2154#true} {2154#true} #145#return; {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L280 TraceCheckUtils]: 44: Hoare triple {2154#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L263 TraceCheckUtils]: 45: Hoare triple {2154#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L280 TraceCheckUtils]: 46: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:57,777 INFO L280 TraceCheckUtils]: 47: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:57,778 INFO L280 TraceCheckUtils]: 48: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,778 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2154#true} {2154#true} #147#return; {2154#true} is VALID [2020-07-28 19:13:57,778 INFO L280 TraceCheckUtils]: 50: Hoare triple {2154#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2154#true} is VALID [2020-07-28 19:13:57,778 INFO L280 TraceCheckUtils]: 51: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:57,780 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2154#true} {2188#(not (= 0 ULTIMATE.start_task_~t.base))} #153#return; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,780 INFO L280 TraceCheckUtils]: 53: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,781 INFO L280 TraceCheckUtils]: 54: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} assume !(0 == assume_abort_if_not_~cond); {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,782 INFO L280 TraceCheckUtils]: 55: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,782 INFO L280 TraceCheckUtils]: 56: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:57,784 INFO L263 TraceCheckUtils]: 57: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {2236#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:57,785 INFO L280 TraceCheckUtils]: 58: Hoare triple {2236#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-28 19:13:57,785 INFO L280 TraceCheckUtils]: 59: Hoare triple {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:57,786 INFO L280 TraceCheckUtils]: 60: Hoare triple {2238#(= 0 |tree_inorder_#in~t.base|)} assume true; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:57,788 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2238#(= 0 |tree_inorder_#in~t.base|)} {2188#(not (= 0 ULTIMATE.start_task_~t.base))} #155#return; {2155#false} is VALID [2020-07-28 19:13:57,788 INFO L280 TraceCheckUtils]: 62: Hoare triple {2155#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2155#false} is VALID [2020-07-28 19:13:57,788 INFO L280 TraceCheckUtils]: 63: Hoare triple {2155#false} assume 0 == __VERIFIER_assert_~cond; {2155#false} is VALID [2020-07-28 19:13:57,789 INFO L280 TraceCheckUtils]: 64: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2020-07-28 19:13:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-28 19:13:57,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113596496] [2020-07-28 19:13:57,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835578818] [2020-07-28 19:13:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:13:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-28 19:13:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:57,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:58,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {2154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2154#true} is VALID [2020-07-28 19:13:58,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {2154#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {2154#true} is VALID [2020-07-28 19:13:58,055 INFO L263 TraceCheckUtils]: 2: Hoare triple {2154#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {2154#true} is VALID [2020-07-28 19:13:58,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {2154#true} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:58,056 INFO L263 TraceCheckUtils]: 4: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2154#true} is VALID [2020-07-28 19:13:58,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {2154#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:58,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,057 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #135#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:58,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:58,058 INFO L263 TraceCheckUtils]: 9: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2154#true} is VALID [2020-07-28 19:13:58,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2154#true} is VALID [2020-07-28 19:13:58,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,059 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2154#true} {2210#(= nondet_tree_~n~0.offset 0)} #137#return; {2210#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:58,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {2210#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:58,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {2217#(= 0 |nondet_tree_#res.offset|)} assume true; {2217#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:58,061 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2217#(= 0 |nondet_tree_#res.offset|)} {2154#true} #149#return; {2169#(= 0 |ULTIMATE.start_main_#t~ret38.offset|)} is VALID [2020-07-28 19:13:58,061 INFO L280 TraceCheckUtils]: 16: Hoare triple {2169#(= 0 |ULTIMATE.start_main_#t~ret38.offset|)} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2170#(= 0 ULTIMATE.start_task_~t.offset)} is VALID [2020-07-28 19:13:58,062 INFO L263 TraceCheckUtils]: 17: Hoare triple {2170#(= 0 ULTIMATE.start_task_~t.offset)} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {2154#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L263 TraceCheckUtils]: 20: Hoare triple {2154#true} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L280 TraceCheckUtils]: 22: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:58,062 INFO L280 TraceCheckUtils]: 23: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,063 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2154#true} {2154#true} #141#return; {2154#true} is VALID [2020-07-28 19:13:58,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {2154#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2154#true} is VALID [2020-07-28 19:13:58,063 INFO L263 TraceCheckUtils]: 26: Hoare triple {2154#true} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2154#true} is VALID [2020-07-28 19:13:58,063 INFO L280 TraceCheckUtils]: 27: Hoare triple {2154#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2154#true} is VALID [2020-07-28 19:13:58,064 INFO L280 TraceCheckUtils]: 28: Hoare triple {2154#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2154#true} is VALID [2020-07-28 19:13:58,064 INFO L280 TraceCheckUtils]: 29: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,064 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2154#true} {2154#true} #143#return; {2154#true} is VALID [2020-07-28 19:13:58,064 INFO L280 TraceCheckUtils]: 31: Hoare triple {2154#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2154#true} is VALID [2020-07-28 19:13:58,067 INFO L280 TraceCheckUtils]: 32: Hoare triple {2154#true} assume ~a~0 <= ~b~0;#res := ~a~0; {2154#true} is VALID [2020-07-28 19:13:58,067 INFO L280 TraceCheckUtils]: 33: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,073 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2154#true} {2170#(= 0 ULTIMATE.start_task_~t.offset)} #151#return; {2170#(= 0 ULTIMATE.start_task_~t.offset)} is VALID [2020-07-28 19:13:58,079 INFO L280 TraceCheckUtils]: 35: Hoare triple {2170#(= 0 ULTIMATE.start_task_~t.offset)} assume -2147483648 <= task_#t~ret25 && task_#t~ret25 <= 2147483647;task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4); {2170#(= 0 ULTIMATE.start_task_~t.offset)} is VALID [2020-07-28 19:13:58,080 INFO L263 TraceCheckUtils]: 36: Hoare triple {2170#(= 0 ULTIMATE.start_task_~t.offset)} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {2154#true} is VALID [2020-07-28 19:13:58,080 INFO L280 TraceCheckUtils]: 37: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2353#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-28 19:13:58,081 INFO L280 TraceCheckUtils]: 38: Hoare triple {2353#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,081 INFO L263 TraceCheckUtils]: 39: Hoare triple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2154#true} is VALID [2020-07-28 19:13:58,082 INFO L280 TraceCheckUtils]: 40: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:58,082 INFO L280 TraceCheckUtils]: 41: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:58,082 INFO L280 TraceCheckUtils]: 42: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,083 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2154#true} {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #145#return; {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,084 INFO L280 TraceCheckUtils]: 44: Hoare triple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,084 INFO L263 TraceCheckUtils]: 45: Hoare triple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2154#true} is VALID [2020-07-28 19:13:58,084 INFO L280 TraceCheckUtils]: 46: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2154#true} is VALID [2020-07-28 19:13:58,084 INFO L280 TraceCheckUtils]: 47: Hoare triple {2154#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2154#true} is VALID [2020-07-28 19:13:58,084 INFO L280 TraceCheckUtils]: 48: Hoare triple {2154#true} assume true; {2154#true} is VALID [2020-07-28 19:13:58,085 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2154#true} {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #147#return; {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,086 INFO L280 TraceCheckUtils]: 50: Hoare triple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,087 INFO L280 TraceCheckUtils]: 51: Hoare triple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-28 19:13:58,088 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2357#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {2170#(= 0 ULTIMATE.start_task_~t.offset)} #153#return; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:58,088 INFO L280 TraceCheckUtils]: 53: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} assume -2147483648 <= task_#t~ret26 && task_#t~ret26 <= 2147483647;task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0 != task_~n~1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:58,089 INFO L280 TraceCheckUtils]: 54: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} assume !(0 == assume_abort_if_not_~cond); {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:58,089 INFO L280 TraceCheckUtils]: 55: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(4 * task_~n~1);#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4, 4 * task_~n~1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:58,090 INFO L280 TraceCheckUtils]: 56: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {2188#(not (= 0 ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:13:58,090 INFO L263 TraceCheckUtils]: 57: Hoare triple {2188#(not (= 0 ULTIMATE.start_task_~t.base))} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {2154#true} is VALID [2020-07-28 19:13:58,091 INFO L280 TraceCheckUtils]: 58: Hoare triple {2154#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-28 19:13:58,092 INFO L280 TraceCheckUtils]: 59: Hoare triple {2237#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:58,092 INFO L280 TraceCheckUtils]: 60: Hoare triple {2238#(= 0 |tree_inorder_#in~t.base|)} assume true; {2238#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:13:58,094 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2238#(= 0 |tree_inorder_#in~t.base|)} {2188#(not (= 0 ULTIMATE.start_task_~t.base))} #155#return; {2155#false} is VALID [2020-07-28 19:13:58,094 INFO L280 TraceCheckUtils]: 62: Hoare triple {2155#false} assume -2147483648 <= task_#t~ret28 && task_#t~ret28 <= 2147483647;havoc task_#t~ret28;call task_#t~mem29 := read~int(task_~x~0.base, task_~x~0.offset, 4);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2155#false} is VALID [2020-07-28 19:13:58,094 INFO L280 TraceCheckUtils]: 63: Hoare triple {2155#false} assume 0 == __VERIFIER_assert_~cond; {2155#false} is VALID [2020-07-28 19:13:58,094 INFO L280 TraceCheckUtils]: 64: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2020-07-28 19:13:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-28 19:13:58,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:13:58,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2020-07-28 19:13:58,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643263239] [2020-07-28 19:13:58,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2020-07-28 19:13:58,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:58,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 19:13:58,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:58,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 19:13:58,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 19:13:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:13:58,204 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 15 states. [2020-07-28 19:14:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:01,361 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2020-07-28 19:14:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-28 19:14:01,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2020-07-28 19:14:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:14:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 168 transitions. [2020-07-28 19:14:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:14:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 168 transitions. [2020-07-28 19:14:01,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 168 transitions. [2020-07-28 19:14:01,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:01,652 INFO L225 Difference]: With dead ends: 137 [2020-07-28 19:14:01,652 INFO L226 Difference]: Without dead ends: 87 [2020-07-28 19:14:01,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2020-07-28 19:14:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-28 19:14:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2020-07-28 19:14:01,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:01,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2020-07-28 19:14:01,709 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2020-07-28 19:14:01,709 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2020-07-28 19:14:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:01,715 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2020-07-28 19:14:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2020-07-28 19:14:01,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:01,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:01,716 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2020-07-28 19:14:01,716 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2020-07-28 19:14:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:01,721 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2020-07-28 19:14:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2020-07-28 19:14:01,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:01,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:01,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:01,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-28 19:14:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2020-07-28 19:14:01,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 65 [2020-07-28 19:14:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:01,728 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2020-07-28 19:14:01,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 19:14:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2020-07-28 19:14:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-28 19:14:01,730 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:01,730 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:01,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:14:01,945 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1767582969, now seen corresponding path program 1 times [2020-07-28 19:14:01,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:14:01,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31307869] [2020-07-28 19:14:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:14:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:02,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:02,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:02,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 19:14:02,137 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:14:02,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 19:14:02,195 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,200 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,200 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,201 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,206 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,206 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,207 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,207 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,208 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,208 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,209 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,209 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:02,242 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret38 := nondet_tree(); [2020-07-28 19:14:02,243 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:216) 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:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:14:02,256 INFO L168 Benchmark]: Toolchain (without parser) took 15224.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 961.6 MB in the beginning and 926.4 MB in the end (delta: 35.2 MB). Peak memory consumption was 361.3 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:02,266 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:14:02,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -99.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:02,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:14:02,268 INFO L168 Benchmark]: Boogie Preprocessor took 74.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:02,271 INFO L168 Benchmark]: RCFGBuilder took 848.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.9 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:02,272 INFO L168 Benchmark]: TraceAbstraction took 13799.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 253.2 MB). Free memory was 998.9 MB in the beginning and 926.4 MB in the end (delta: 72.5 MB). Peak memory consumption was 325.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:02,275 INFO L336 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.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -99.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 848.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.9 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13799.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 253.2 MB). Free memory was 998.9 MB in the beginning and 926.4 MB in the end (delta: 72.5 MB). Peak memory consumption was 325.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:14:04,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:14:04,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:14:04,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:14:04,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:14:04,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:14:04,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:14:04,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:14:04,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:14:04,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:14:04,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:14:04,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:14:04,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:14:04,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:14:04,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:14:04,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:14:04,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:14:04,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:14:04,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:14:04,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:14:04,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:14:04,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:14:04,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:14:04,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:14:04,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:14:04,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:14:04,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:14:04,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:14:04,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:14:04,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:14:04,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:14:04,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:14:04,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:14:04,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:14:04,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:14:04,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:14:04,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:14:04,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:14:04,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:14:04,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:14:04,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:14:04,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 19:14:04,314 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:14:04,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:14:04,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:14:04,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:14:04,317 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:14:04,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:14:04,318 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:14:04,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:14:04,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:14:04,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:14:04,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:14:04,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:14:04,319 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 19:14:04,320 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 19:14:04,320 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:14:04,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:14:04,321 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:14:04,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:14:04,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:14:04,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:14:04,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:14:04,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:14:04,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:14:04,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:14:04,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:14:04,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:14:04,323 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 19:14:04,324 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 19:14:04,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:14:04,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:14:04,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 19:14:04,325 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 0ab962fe7228ac89b10b808ceccbcc2ec1ea47fa [2020-07-28 19:14:04,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:14:04,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:14:04,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:14:04,646 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:14:04,647 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:14:04,648 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-07-28 19:14:04,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7651579/7a5b05b523ce40429417c055ee3a6c8f/FLAGfea2f4e9d [2020-07-28 19:14:05,173 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:14:05,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-07-28 19:14:05,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7651579/7a5b05b523ce40429417c055ee3a6c8f/FLAGfea2f4e9d [2020-07-28 19:14:05,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7651579/7a5b05b523ce40429417c055ee3a6c8f [2020-07-28 19:14:05,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:14:05,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:14:05,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:14:05,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:14:05,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:14:05,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:05,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39957221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05, skipping insertion in model container [2020-07-28 19:14:05,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:05,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:14:05,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:14:05,784 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:14:05,786 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:14:05,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:14:05,910 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:14:05,930 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:14:05,932 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-28 19:14:05,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:14:05,970 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:14:05,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05 WrapperNode [2020-07-28 19:14:05,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:14:05,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:14:05,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:14:05,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:14:05,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:05,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:14:06,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:14:06,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:14:06,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:14:06,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... [2020-07-28 19:14:06,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:14:06,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:14:06,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:14:06,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:14:06,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:14:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 19:14:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 19:14:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-28 19:14:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-28 19:14:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-28 19:14:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-28 19:14:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 19:14:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 19:14:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-28 19:14:06,163 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-28 19:14:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 19:14:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-28 19:14:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-28 19:14:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:14:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:14:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-28 19:14:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-28 19:14:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 19:14:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 19:14:06,968 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:14:06,968 INFO L295 CfgBuilder]: Removed 21 assume(true) statements. [2020-07-28 19:14:06,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:14:06 BoogieIcfgContainer [2020-07-28 19:14:06,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:14:06,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:14:06,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:14:06,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:14:06,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:14:05" (1/3) ... [2020-07-28 19:14:06,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec7d478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:14:06, skipping insertion in model container [2020-07-28 19:14:06,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:14:05" (2/3) ... [2020-07-28 19:14:06,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec7d478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:14:06, skipping insertion in model container [2020-07-28 19:14:06,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:14:06" (3/3) ... [2020-07-28 19:14:06,983 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-07-28 19:14:06,996 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:14:07,005 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-07-28 19:14:07,020 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-07-28 19:14:07,048 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:14:07,048 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:14:07,049 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:14:07,049 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:14:07,049 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:14:07,049 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:14:07,050 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:14:07,050 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:14:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-28 19:14:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-28 19:14:07,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:07,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:07,086 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1095170897, now seen corresponding path program 1 times [2020-07-28 19:14:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:07,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761784656] [2020-07-28 19:14:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:07,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 19:14:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:07,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:07,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {84#true} is VALID [2020-07-28 19:14:07,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {84#true} is VALID [2020-07-28 19:14:07,336 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {84#true} is VALID [2020-07-28 19:14:07,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {84#true} is VALID [2020-07-28 19:14:07,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,338 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #149#return; {84#true} is VALID [2020-07-28 19:14:07,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {84#true} is VALID [2020-07-28 19:14:07,339 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:14:07,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {84#true} is VALID [2020-07-28 19:14:07,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {84#true} is VALID [2020-07-28 19:14:07,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,340 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {84#true} {84#true} #151#return; {84#true} is VALID [2020-07-28 19:14:07,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {84#true} is VALID [2020-07-28 19:14:07,341 INFO L263 TraceCheckUtils]: 13: Hoare triple {84#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:14:07,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {84#true} is VALID [2020-07-28 19:14:07,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {84#true} is VALID [2020-07-28 19:14:07,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,343 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {84#true} {84#true} #153#return; {84#true} is VALID [2020-07-28 19:14:07,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {84#true} is VALID [2020-07-28 19:14:07,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {85#false} is VALID [2020-07-28 19:14:07,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {85#false} is VALID [2020-07-28 19:14:07,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {85#false} is VALID [2020-07-28 19:14:07,346 INFO L263 TraceCheckUtils]: 22: Hoare triple {85#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {85#false} is VALID [2020-07-28 19:14:07,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {85#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {85#false} is VALID [2020-07-28 19:14:07,347 INFO L280 TraceCheckUtils]: 24: Hoare triple {85#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {85#false} is VALID [2020-07-28 19:14:07,347 INFO L280 TraceCheckUtils]: 25: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-28 19:14:07,348 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {85#false} {85#false} #155#return; {85#false} is VALID [2020-07-28 19:14:07,348 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {85#false} is VALID [2020-07-28 19:14:07,349 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume 0bv32 == __VERIFIER_assert_~cond; {85#false} is VALID [2020-07-28 19:14:07,349 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-28 19:14:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:14:07,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:07,446 INFO L280 TraceCheckUtils]: 29: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-28 19:14:07,447 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume 0bv32 == __VERIFIER_assert_~cond; {85#false} is VALID [2020-07-28 19:14:07,447 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {85#false} is VALID [2020-07-28 19:14:07,448 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {84#true} {85#false} #155#return; {85#false} is VALID [2020-07-28 19:14:07,448 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,449 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {84#true} is VALID [2020-07-28 19:14:07,449 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {84#true} is VALID [2020-07-28 19:14:07,449 INFO L263 TraceCheckUtils]: 22: Hoare triple {85#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {84#true} is VALID [2020-07-28 19:14:07,450 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {85#false} is VALID [2020-07-28 19:14:07,450 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {85#false} is VALID [2020-07-28 19:14:07,451 INFO L280 TraceCheckUtils]: 19: Hoare triple {84#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {85#false} is VALID [2020-07-28 19:14:07,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {84#true} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {84#true} is VALID [2020-07-28 19:14:07,452 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {84#true} {84#true} #153#return; {84#true} is VALID [2020-07-28 19:14:07,452 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,453 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {84#true} is VALID [2020-07-28 19:14:07,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {84#true} is VALID [2020-07-28 19:14:07,454 INFO L263 TraceCheckUtils]: 13: Hoare triple {84#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:14:07,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {84#true} is VALID [2020-07-28 19:14:07,454 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {84#true} {84#true} #151#return; {84#true} is VALID [2020-07-28 19:14:07,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,456 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {84#true} is VALID [2020-07-28 19:14:07,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {84#true} is VALID [2020-07-28 19:14:07,456 INFO L263 TraceCheckUtils]: 7: Hoare triple {84#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {84#true} is VALID [2020-07-28 19:14:07,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {84#true} is VALID [2020-07-28 19:14:07,457 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #149#return; {84#true} is VALID [2020-07-28 19:14:07,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-28 19:14:07,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {84#true} is VALID [2020-07-28 19:14:07,458 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {84#true} is VALID [2020-07-28 19:14:07,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {84#true} is VALID [2020-07-28 19:14:07,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {84#true} is VALID [2020-07-28 19:14:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:14:07,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761784656] [2020-07-28 19:14:07,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:07,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 19:14:07,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621274675] [2020-07-28 19:14:07,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2020-07-28 19:14:07,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:07,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 19:14:07,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:07,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 19:14:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 19:14:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 19:14:07,558 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2020-07-28 19:14:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:07,854 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2020-07-28 19:14:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 19:14:07,855 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2020-07-28 19:14:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 19:14:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2020-07-28 19:14:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 19:14:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 174 transitions. [2020-07-28 19:14:07,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 174 transitions. [2020-07-28 19:14:08,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:08,273 INFO L225 Difference]: With dead ends: 137 [2020-07-28 19:14:08,274 INFO L226 Difference]: Without dead ends: 76 [2020-07-28 19:14:08,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 19:14:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-28 19:14:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-28 19:14:08,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:08,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2020-07-28 19:14:08,340 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-28 19:14:08,340 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-28 19:14:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:08,352 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2020-07-28 19:14:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-28 19:14:08,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:08,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:08,355 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-28 19:14:08,355 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-28 19:14:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:08,365 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2020-07-28 19:14:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-28 19:14:08,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:08,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:08,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:08,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-28 19:14:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2020-07-28 19:14:08,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 30 [2020-07-28 19:14:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:08,378 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2020-07-28 19:14:08,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 19:14:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-07-28 19:14:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-28 19:14:08,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:08,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:08,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 19:14:08,593 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -394106319, now seen corresponding path program 1 times [2020-07-28 19:14:08,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:08,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90976090] [2020-07-28 19:14:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:08,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:14:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:08,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:08,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {684#true} is VALID [2020-07-28 19:14:08,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {684#true} is VALID [2020-07-28 19:14:08,779 INFO L263 TraceCheckUtils]: 2: Hoare triple {684#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {684#true} is VALID [2020-07-28 19:14:08,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {684#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {684#true} is VALID [2020-07-28 19:14:08,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-28 19:14:08,780 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {684#true} {684#true} #149#return; {684#true} is VALID [2020-07-28 19:14:08,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {684#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {684#true} is VALID [2020-07-28 19:14:08,780 INFO L263 TraceCheckUtils]: 7: Hoare triple {684#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {684#true} is VALID [2020-07-28 19:14:08,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {684#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {684#true} is VALID [2020-07-28 19:14:08,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {684#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {684#true} is VALID [2020-07-28 19:14:08,781 INFO L280 TraceCheckUtils]: 10: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-28 19:14:08,782 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {684#true} {684#true} #151#return; {684#true} is VALID [2020-07-28 19:14:08,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {684#true} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {684#true} is VALID [2020-07-28 19:14:08,782 INFO L263 TraceCheckUtils]: 13: Hoare triple {684#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {684#true} is VALID [2020-07-28 19:14:08,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {684#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {684#true} is VALID [2020-07-28 19:14:08,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {684#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {734#(= |size_#res| (_ bv0 32))} is VALID [2020-07-28 19:14:08,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {734#(= |size_#res| (_ bv0 32))} assume true; {734#(= |size_#res| (_ bv0 32))} is VALID [2020-07-28 19:14:08,786 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {734#(= |size_#res| (_ bv0 32))} {684#true} #153#return; {741#(= |ULTIMATE.start_task_#t~ret26| (_ bv0 32))} is VALID [2020-07-28 19:14:08,788 INFO L280 TraceCheckUtils]: 18: Hoare triple {741#(= |ULTIMATE.start_task_#t~ret26| (_ bv0 32))} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {745#(= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-28 19:14:08,789 INFO L280 TraceCheckUtils]: 19: Hoare triple {745#(= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0bv32 == assume_abort_if_not_~cond); {685#false} is VALID [2020-07-28 19:14:08,789 INFO L280 TraceCheckUtils]: 20: Hoare triple {685#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {685#false} is VALID [2020-07-28 19:14:08,790 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {685#false} is VALID [2020-07-28 19:14:08,790 INFO L263 TraceCheckUtils]: 22: Hoare triple {685#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {685#false} is VALID [2020-07-28 19:14:08,791 INFO L280 TraceCheckUtils]: 23: Hoare triple {685#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {685#false} is VALID [2020-07-28 19:14:08,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {685#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {685#false} is VALID [2020-07-28 19:14:08,792 INFO L280 TraceCheckUtils]: 25: Hoare triple {685#false} assume true; {685#false} is VALID [2020-07-28 19:14:08,792 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {685#false} {685#false} #155#return; {685#false} is VALID [2020-07-28 19:14:08,792 INFO L280 TraceCheckUtils]: 27: Hoare triple {685#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {685#false} is VALID [2020-07-28 19:14:08,793 INFO L280 TraceCheckUtils]: 28: Hoare triple {685#false} assume 0bv32 == __VERIFIER_assert_~cond; {685#false} is VALID [2020-07-28 19:14:08,793 INFO L280 TraceCheckUtils]: 29: Hoare triple {685#false} assume !false; {685#false} is VALID [2020-07-28 19:14:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:14:08,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:08,868 INFO L342 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-28 19:14:08,869 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 19:14:08,925 INFO L280 TraceCheckUtils]: 29: Hoare triple {685#false} assume !false; {685#false} is VALID [2020-07-28 19:14:08,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {685#false} assume 0bv32 == __VERIFIER_assert_~cond; {685#false} is VALID [2020-07-28 19:14:08,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {685#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {685#false} is VALID [2020-07-28 19:14:08,926 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {684#true} {685#false} #155#return; {685#false} is VALID [2020-07-28 19:14:08,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-28 19:14:08,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {684#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {684#true} is VALID [2020-07-28 19:14:08,927 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {684#true} is VALID [2020-07-28 19:14:08,928 INFO L263 TraceCheckUtils]: 22: Hoare triple {685#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {684#true} is VALID [2020-07-28 19:14:08,928 INFO L280 TraceCheckUtils]: 21: Hoare triple {685#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {685#false} is VALID [2020-07-28 19:14:08,928 INFO L280 TraceCheckUtils]: 20: Hoare triple {685#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {685#false} is VALID [2020-07-28 19:14:08,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {745#(= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0bv32 == assume_abort_if_not_~cond); {685#false} is VALID [2020-07-28 19:14:08,930 INFO L280 TraceCheckUtils]: 18: Hoare triple {741#(= |ULTIMATE.start_task_#t~ret26| (_ bv0 32))} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {745#(= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-28 19:14:08,932 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {734#(= |size_#res| (_ bv0 32))} {684#true} #153#return; {741#(= |ULTIMATE.start_task_#t~ret26| (_ bv0 32))} is VALID [2020-07-28 19:14:08,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {734#(= |size_#res| (_ bv0 32))} assume true; {734#(= |size_#res| (_ bv0 32))} is VALID [2020-07-28 19:14:08,934 INFO L280 TraceCheckUtils]: 15: Hoare triple {684#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {734#(= |size_#res| (_ bv0 32))} is VALID [2020-07-28 19:14:08,934 INFO L280 TraceCheckUtils]: 14: Hoare triple {684#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {684#true} is VALID [2020-07-28 19:14:08,934 INFO L263 TraceCheckUtils]: 13: Hoare triple {684#true} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {684#true} is VALID [2020-07-28 19:14:08,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {684#true} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {684#true} is VALID [2020-07-28 19:14:08,935 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {684#true} {684#true} #151#return; {684#true} is VALID [2020-07-28 19:14:08,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-28 19:14:08,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {684#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {684#true} is VALID [2020-07-28 19:14:08,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {684#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {684#true} is VALID [2020-07-28 19:14:08,936 INFO L263 TraceCheckUtils]: 7: Hoare triple {684#true} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {684#true} is VALID [2020-07-28 19:14:08,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {684#true} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {684#true} is VALID [2020-07-28 19:14:08,937 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {684#true} {684#true} #149#return; {684#true} is VALID [2020-07-28 19:14:08,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-28 19:14:08,938 INFO L280 TraceCheckUtils]: 3: Hoare triple {684#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {684#true} is VALID [2020-07-28 19:14:08,938 INFO L263 TraceCheckUtils]: 2: Hoare triple {684#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {684#true} is VALID [2020-07-28 19:14:08,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {684#true} is VALID [2020-07-28 19:14:08,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {684#true} is VALID [2020-07-28 19:14:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 19:14:08,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90976090] [2020-07-28 19:14:08,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:08,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-28 19:14:08,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99212422] [2020-07-28 19:14:08,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-28 19:14:08,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:08,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:14:09,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:09,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:14:09,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:14:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:14:09,003 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 5 states. [2020-07-28 19:14:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:09,753 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2020-07-28 19:14:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:14:09,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-28 19:14:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:14:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2020-07-28 19:14:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:14:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2020-07-28 19:14:09,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 160 transitions. [2020-07-28 19:14:10,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:10,095 INFO L225 Difference]: With dead ends: 131 [2020-07-28 19:14:10,097 INFO L226 Difference]: Without dead ends: 78 [2020-07-28 19:14:10,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:14:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-28 19:14:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-28 19:14:10,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:10,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-28 19:14:10,127 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-28 19:14:10,127 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-28 19:14:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:10,137 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-28 19:14:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-07-28 19:14:10,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:10,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:10,148 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-28 19:14:10,148 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-28 19:14:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:10,159 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2020-07-28 19:14:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-07-28 19:14:10,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:10,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:10,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:10,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-28 19:14:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2020-07-28 19:14:10,172 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 30 [2020-07-28 19:14:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:10,173 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2020-07-28 19:14:10,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:14:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-07-28 19:14:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-28 19:14:10,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:10,176 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:10,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 19:14:10,391 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1904559170, now seen corresponding path program 1 times [2020-07-28 19:14:10,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:10,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443721617] [2020-07-28 19:14:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:10,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 19:14:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:10,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:10,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {1287#true} is VALID [2020-07-28 19:14:10,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {1287#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1287#true} is VALID [2020-07-28 19:14:10,726 INFO L263 TraceCheckUtils]: 2: Hoare triple {1287#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1287#true} is VALID [2020-07-28 19:14:10,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {1287#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:10,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:10,730 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} {1287#true} #149#return; {1308#(and (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret38.offset| (_ bv0 32)))} is VALID [2020-07-28 19:14:10,731 INFO L280 TraceCheckUtils]: 6: Hoare triple {1308#(and (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret38.offset| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:10,731 INFO L263 TraceCheckUtils]: 7: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1287#true} is VALID [2020-07-28 19:14:10,732 INFO L280 TraceCheckUtils]: 8: Hoare triple {1287#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1287#true} is VALID [2020-07-28 19:14:10,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {1287#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {1287#true} is VALID [2020-07-28 19:14:10,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:10,734 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1287#true} {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} #151#return; {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:10,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:10,735 INFO L263 TraceCheckUtils]: 13: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1287#true} is VALID [2020-07-28 19:14:10,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1337#(and (= size_~t.base |size_#in~t.base|) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-28 19:14:10,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {1337#(and (= size_~t.base |size_#in~t.base|) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,738 INFO L263 TraceCheckUtils]: 16: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1287#true} is VALID [2020-07-28 19:14:10,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1287#true} is VALID [2020-07-28 19:14:10,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {1287#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1287#true} is VALID [2020-07-28 19:14:10,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:10,740 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1287#true} {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #145#return; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,741 INFO L280 TraceCheckUtils]: 21: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,741 INFO L263 TraceCheckUtils]: 22: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1287#true} is VALID [2020-07-28 19:14:10,741 INFO L280 TraceCheckUtils]: 23: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1287#true} is VALID [2020-07-28 19:14:10,741 INFO L280 TraceCheckUtils]: 24: Hoare triple {1287#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1287#true} is VALID [2020-07-28 19:14:10,742 INFO L280 TraceCheckUtils]: 25: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:10,743 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1287#true} {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #147#return; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,744 INFO L280 TraceCheckUtils]: 27: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,745 INFO L280 TraceCheckUtils]: 28: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} assume true; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:10,746 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} #153#return; {1288#false} is VALID [2020-07-28 19:14:10,746 INFO L280 TraceCheckUtils]: 30: Hoare triple {1288#false} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1288#false} is VALID [2020-07-28 19:14:10,746 INFO L280 TraceCheckUtils]: 31: Hoare triple {1288#false} assume !(0bv32 == assume_abort_if_not_~cond); {1288#false} is VALID [2020-07-28 19:14:10,747 INFO L280 TraceCheckUtils]: 32: Hoare triple {1288#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1288#false} is VALID [2020-07-28 19:14:10,747 INFO L280 TraceCheckUtils]: 33: Hoare triple {1288#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1288#false} is VALID [2020-07-28 19:14:10,747 INFO L263 TraceCheckUtils]: 34: Hoare triple {1288#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1288#false} is VALID [2020-07-28 19:14:10,748 INFO L280 TraceCheckUtils]: 35: Hoare triple {1288#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1288#false} is VALID [2020-07-28 19:14:10,748 INFO L280 TraceCheckUtils]: 36: Hoare triple {1288#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {1288#false} is VALID [2020-07-28 19:14:10,748 INFO L280 TraceCheckUtils]: 37: Hoare triple {1288#false} assume true; {1288#false} is VALID [2020-07-28 19:14:10,748 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1288#false} {1288#false} #155#return; {1288#false} is VALID [2020-07-28 19:14:10,749 INFO L280 TraceCheckUtils]: 39: Hoare triple {1288#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1288#false} is VALID [2020-07-28 19:14:10,749 INFO L280 TraceCheckUtils]: 40: Hoare triple {1288#false} assume 0bv32 == __VERIFIER_assert_~cond; {1288#false} is VALID [2020-07-28 19:14:10,749 INFO L280 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2020-07-28 19:14:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 19:14:10,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:11,026 INFO L280 TraceCheckUtils]: 41: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2020-07-28 19:14:11,027 INFO L280 TraceCheckUtils]: 40: Hoare triple {1288#false} assume 0bv32 == __VERIFIER_assert_~cond; {1288#false} is VALID [2020-07-28 19:14:11,027 INFO L280 TraceCheckUtils]: 39: Hoare triple {1288#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1288#false} is VALID [2020-07-28 19:14:11,027 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1287#true} {1288#false} #155#return; {1288#false} is VALID [2020-07-28 19:14:11,027 INFO L280 TraceCheckUtils]: 37: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:11,028 INFO L280 TraceCheckUtils]: 36: Hoare triple {1287#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {1287#true} is VALID [2020-07-28 19:14:11,028 INFO L280 TraceCheckUtils]: 35: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1287#true} is VALID [2020-07-28 19:14:11,028 INFO L263 TraceCheckUtils]: 34: Hoare triple {1288#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1287#true} is VALID [2020-07-28 19:14:11,028 INFO L280 TraceCheckUtils]: 33: Hoare triple {1288#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1288#false} is VALID [2020-07-28 19:14:11,029 INFO L280 TraceCheckUtils]: 32: Hoare triple {1288#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1288#false} is VALID [2020-07-28 19:14:11,029 INFO L280 TraceCheckUtils]: 31: Hoare triple {1288#false} assume !(0bv32 == assume_abort_if_not_~cond); {1288#false} is VALID [2020-07-28 19:14:11,032 INFO L280 TraceCheckUtils]: 30: Hoare triple {1288#false} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1288#false} is VALID [2020-07-28 19:14:11,036 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} #153#return; {1288#false} is VALID [2020-07-28 19:14:11,036 INFO L280 TraceCheckUtils]: 28: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} assume true; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,037 INFO L280 TraceCheckUtils]: 27: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,038 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1287#true} {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #147#return; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,038 INFO L280 TraceCheckUtils]: 25: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:11,039 INFO L280 TraceCheckUtils]: 24: Hoare triple {1287#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1287#true} is VALID [2020-07-28 19:14:11,039 INFO L280 TraceCheckUtils]: 23: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1287#true} is VALID [2020-07-28 19:14:11,040 INFO L263 TraceCheckUtils]: 22: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1287#true} is VALID [2020-07-28 19:14:11,041 INFO L280 TraceCheckUtils]: 21: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,042 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1287#true} {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} #145#return; {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:11,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {1287#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1287#true} is VALID [2020-07-28 19:14:11,043 INFO L280 TraceCheckUtils]: 17: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1287#true} is VALID [2020-07-28 19:14:11,043 INFO L263 TraceCheckUtils]: 16: Hoare triple {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1287#true} is VALID [2020-07-28 19:14:11,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {1501#(or (and (= (_ bv0 32) size_~t.base) (= (_ bv0 32) size_~t.offset)) (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {1341#(or (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {1287#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1501#(or (and (= (_ bv0 32) size_~t.base) (= (_ bv0 32) size_~t.offset)) (not (= (_ bv0 32) |size_#in~t.base|)) (not (= (_ bv0 32) |size_#in~t.offset|)))} is VALID [2020-07-28 19:14:11,049 INFO L263 TraceCheckUtils]: 13: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1287#true} is VALID [2020-07-28 19:14:11,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:11,055 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1287#true} {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} #151#return; {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:11,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {1287#true} assume true; {1287#true} is VALID [2020-07-28 19:14:11,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {1287#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {1287#true} is VALID [2020-07-28 19:14:11,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {1287#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1287#true} is VALID [2020-07-28 19:14:11,056 INFO L263 TraceCheckUtils]: 7: Hoare triple {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1287#true} is VALID [2020-07-28 19:14:11,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {1308#(and (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret38.offset| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {1312#(and (= (_ bv0 32) ULTIMATE.start_task_~t.base) (= (_ bv0 32) ULTIMATE.start_task_~t.offset))} is VALID [2020-07-28 19:14:11,057 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} {1287#true} #149#return; {1308#(and (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret38.offset| (_ bv0 32)))} is VALID [2020-07-28 19:14:11,058 INFO L280 TraceCheckUtils]: 4: Hoare triple {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:11,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {1287#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1301#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:11,059 INFO L263 TraceCheckUtils]: 2: Hoare triple {1287#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1287#true} is VALID [2020-07-28 19:14:11,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {1287#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1287#true} is VALID [2020-07-28 19:14:11,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {1287#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {1287#true} is VALID [2020-07-28 19:14:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 19:14:11,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443721617] [2020-07-28 19:14:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:14:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-28 19:14:11,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035647160] [2020-07-28 19:14:11,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-28 19:14:11,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:11,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 19:14:11,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 19:14:11,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 19:14:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:14:11,132 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 8 states. [2020-07-28 19:14:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:12,621 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2020-07-28 19:14:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:14:12,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-28 19:14:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:14:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2020-07-28 19:14:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:14:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2020-07-28 19:14:12,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 169 transitions. [2020-07-28 19:14:12,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:12,918 INFO L225 Difference]: With dead ends: 139 [2020-07-28 19:14:12,919 INFO L226 Difference]: Without dead ends: 80 [2020-07-28 19:14:12,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:14:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-28 19:14:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-28 19:14:12,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:12,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-28 19:14:12,953 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-28 19:14:12,954 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-28 19:14:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:12,960 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2020-07-28 19:14:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-07-28 19:14:12,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:12,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:12,961 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-28 19:14:12,962 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-28 19:14:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:12,968 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2020-07-28 19:14:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-07-28 19:14:12,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:12,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:12,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:12,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-28 19:14:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2020-07-28 19:14:12,975 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 42 [2020-07-28 19:14:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:12,975 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2020-07-28 19:14:12,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 19:14:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-07-28 19:14:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-28 19:14:12,977 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:12,977 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:13,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 19:14:13,189 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1838253317, now seen corresponding path program 1 times [2020-07-28 19:14:13,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:13,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836677022] [2020-07-28 19:14:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:13,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 19:14:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:13,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:13,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {1986#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {1986#true} is VALID [2020-07-28 19:14:13,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1986#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1986#true} is VALID [2020-07-28 19:14:13,473 INFO L263 TraceCheckUtils]: 2: Hoare triple {1986#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {1986#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {1986#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,477 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1986#true} {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #135#return; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,479 INFO L263 TraceCheckUtils]: 9: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {1986#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,479 INFO L280 TraceCheckUtils]: 11: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,481 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1986#true} {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #137#return; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,482 INFO L280 TraceCheckUtils]: 13: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:13,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:13,485 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {1986#true} #149#return; {2038#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:13,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {2038#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:13,486 INFO L263 TraceCheckUtils]: 17: Hoare triple {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1986#true} is VALID [2020-07-28 19:14:13,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {1986#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2049#(= |min_#in~n.base| min_~n.base)} is VALID [2020-07-28 19:14:13,489 INFO L280 TraceCheckUtils]: 19: Hoare triple {2049#(= |min_#in~n.base| min_~n.base)} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2053#(= |min_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:13,490 INFO L280 TraceCheckUtils]: 20: Hoare triple {2053#(= |min_#in~n.base| (_ bv0 32))} assume true; {2053#(= |min_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:13,491 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2053#(= |min_#in~n.base| (_ bv0 32))} {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #151#return; {1987#false} is VALID [2020-07-28 19:14:13,492 INFO L280 TraceCheckUtils]: 22: Hoare triple {1987#false} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {1987#false} is VALID [2020-07-28 19:14:13,492 INFO L263 TraceCheckUtils]: 23: Hoare triple {1987#false} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1987#false} is VALID [2020-07-28 19:14:13,492 INFO L280 TraceCheckUtils]: 24: Hoare triple {1987#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1987#false} is VALID [2020-07-28 19:14:13,492 INFO L280 TraceCheckUtils]: 25: Hoare triple {1987#false} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {1987#false} is VALID [2020-07-28 19:14:13,493 INFO L263 TraceCheckUtils]: 26: Hoare triple {1987#false} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1987#false} is VALID [2020-07-28 19:14:13,493 INFO L280 TraceCheckUtils]: 27: Hoare triple {1987#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1987#false} is VALID [2020-07-28 19:14:13,493 INFO L280 TraceCheckUtils]: 28: Hoare triple {1987#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1987#false} is VALID [2020-07-28 19:14:13,493 INFO L280 TraceCheckUtils]: 29: Hoare triple {1987#false} assume true; {1987#false} is VALID [2020-07-28 19:14:13,493 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1987#false} {1987#false} #145#return; {1987#false} is VALID [2020-07-28 19:14:13,494 INFO L280 TraceCheckUtils]: 31: Hoare triple {1987#false} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {1987#false} is VALID [2020-07-28 19:14:13,494 INFO L263 TraceCheckUtils]: 32: Hoare triple {1987#false} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1987#false} is VALID [2020-07-28 19:14:13,494 INFO L280 TraceCheckUtils]: 33: Hoare triple {1987#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1987#false} is VALID [2020-07-28 19:14:13,496 INFO L280 TraceCheckUtils]: 34: Hoare triple {1987#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1987#false} is VALID [2020-07-28 19:14:13,496 INFO L280 TraceCheckUtils]: 35: Hoare triple {1987#false} assume true; {1987#false} is VALID [2020-07-28 19:14:13,496 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1987#false} {1987#false} #147#return; {1987#false} is VALID [2020-07-28 19:14:13,496 INFO L280 TraceCheckUtils]: 37: Hoare triple {1987#false} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {1987#false} is VALID [2020-07-28 19:14:13,497 INFO L280 TraceCheckUtils]: 38: Hoare triple {1987#false} assume true; {1987#false} is VALID [2020-07-28 19:14:13,497 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1987#false} {1987#false} #153#return; {1987#false} is VALID [2020-07-28 19:14:13,497 INFO L280 TraceCheckUtils]: 40: Hoare triple {1987#false} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1987#false} is VALID [2020-07-28 19:14:13,503 INFO L280 TraceCheckUtils]: 41: Hoare triple {1987#false} assume !(0bv32 == assume_abort_if_not_~cond); {1987#false} is VALID [2020-07-28 19:14:13,504 INFO L280 TraceCheckUtils]: 42: Hoare triple {1987#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1987#false} is VALID [2020-07-28 19:14:13,504 INFO L280 TraceCheckUtils]: 43: Hoare triple {1987#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1987#false} is VALID [2020-07-28 19:14:13,504 INFO L263 TraceCheckUtils]: 44: Hoare triple {1987#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1987#false} is VALID [2020-07-28 19:14:13,504 INFO L280 TraceCheckUtils]: 45: Hoare triple {1987#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1987#false} is VALID [2020-07-28 19:14:13,504 INFO L280 TraceCheckUtils]: 46: Hoare triple {1987#false} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {1987#false} is VALID [2020-07-28 19:14:13,505 INFO L280 TraceCheckUtils]: 47: Hoare triple {1987#false} assume true; {1987#false} is VALID [2020-07-28 19:14:13,505 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1987#false} {1987#false} #155#return; {1987#false} is VALID [2020-07-28 19:14:13,505 INFO L280 TraceCheckUtils]: 49: Hoare triple {1987#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1987#false} is VALID [2020-07-28 19:14:13,505 INFO L280 TraceCheckUtils]: 50: Hoare triple {1987#false} assume 0bv32 == __VERIFIER_assert_~cond; {1987#false} is VALID [2020-07-28 19:14:13,506 INFO L280 TraceCheckUtils]: 51: Hoare triple {1987#false} assume !false; {1987#false} is VALID [2020-07-28 19:14:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-28 19:14:13,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:13,767 INFO L280 TraceCheckUtils]: 51: Hoare triple {1987#false} assume !false; {1987#false} is VALID [2020-07-28 19:14:13,767 INFO L280 TraceCheckUtils]: 50: Hoare triple {1987#false} assume 0bv32 == __VERIFIER_assert_~cond; {1987#false} is VALID [2020-07-28 19:14:13,767 INFO L280 TraceCheckUtils]: 49: Hoare triple {1987#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1987#false} is VALID [2020-07-28 19:14:13,768 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1986#true} {1987#false} #155#return; {1987#false} is VALID [2020-07-28 19:14:13,768 INFO L280 TraceCheckUtils]: 47: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,768 INFO L280 TraceCheckUtils]: 46: Hoare triple {1986#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {1986#true} is VALID [2020-07-28 19:14:13,768 INFO L280 TraceCheckUtils]: 45: Hoare triple {1986#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1986#true} is VALID [2020-07-28 19:14:13,768 INFO L263 TraceCheckUtils]: 44: Hoare triple {1987#false} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {1986#true} is VALID [2020-07-28 19:14:13,769 INFO L280 TraceCheckUtils]: 43: Hoare triple {1987#false} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {1987#false} is VALID [2020-07-28 19:14:13,769 INFO L280 TraceCheckUtils]: 42: Hoare triple {1987#false} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {1987#false} is VALID [2020-07-28 19:14:13,769 INFO L280 TraceCheckUtils]: 41: Hoare triple {1987#false} assume !(0bv32 == assume_abort_if_not_~cond); {1987#false} is VALID [2020-07-28 19:14:13,769 INFO L280 TraceCheckUtils]: 40: Hoare triple {1987#false} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1987#false} is VALID [2020-07-28 19:14:13,770 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1986#true} {1987#false} #153#return; {1987#false} is VALID [2020-07-28 19:14:13,770 INFO L280 TraceCheckUtils]: 38: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,770 INFO L280 TraceCheckUtils]: 37: Hoare triple {1986#true} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {1986#true} is VALID [2020-07-28 19:14:13,770 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1986#true} {1986#true} #147#return; {1986#true} is VALID [2020-07-28 19:14:13,771 INFO L280 TraceCheckUtils]: 35: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,771 INFO L280 TraceCheckUtils]: 34: Hoare triple {1986#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,771 INFO L280 TraceCheckUtils]: 33: Hoare triple {1986#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1986#true} is VALID [2020-07-28 19:14:13,772 INFO L263 TraceCheckUtils]: 32: Hoare triple {1986#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1986#true} is VALID [2020-07-28 19:14:13,772 INFO L280 TraceCheckUtils]: 31: Hoare triple {1986#true} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {1986#true} is VALID [2020-07-28 19:14:13,772 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1986#true} {1986#true} #145#return; {1986#true} is VALID [2020-07-28 19:14:13,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,773 INFO L280 TraceCheckUtils]: 28: Hoare triple {1986#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,773 INFO L280 TraceCheckUtils]: 27: Hoare triple {1986#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1986#true} is VALID [2020-07-28 19:14:13,773 INFO L263 TraceCheckUtils]: 26: Hoare triple {1986#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1986#true} is VALID [2020-07-28 19:14:13,773 INFO L280 TraceCheckUtils]: 25: Hoare triple {1986#true} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {1986#true} is VALID [2020-07-28 19:14:13,774 INFO L280 TraceCheckUtils]: 24: Hoare triple {1986#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1986#true} is VALID [2020-07-28 19:14:13,774 INFO L263 TraceCheckUtils]: 23: Hoare triple {1987#false} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {1986#true} is VALID [2020-07-28 19:14:13,774 INFO L280 TraceCheckUtils]: 22: Hoare triple {1987#false} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {1987#false} is VALID [2020-07-28 19:14:13,775 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2053#(= |min_#in~n.base| (_ bv0 32))} {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #151#return; {1987#false} is VALID [2020-07-28 19:14:13,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {2053#(= |min_#in~n.base| (_ bv0 32))} assume true; {2053#(= |min_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:13,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {2249#(or (not (= (_ bv0 32) min_~n.base)) (= |min_#in~n.base| (_ bv0 32)))} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2053#(= |min_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:13,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {1986#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2249#(or (not (= (_ bv0 32) min_~n.base)) (= |min_#in~n.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:13,777 INFO L263 TraceCheckUtils]: 17: Hoare triple {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {1986#true} is VALID [2020-07-28 19:14:13,778 INFO L280 TraceCheckUtils]: 16: Hoare triple {2038#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2042#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:13,779 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {1986#true} #149#return; {2038#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:13,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:13,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2031#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:13,782 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1986#true} {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #137#return; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {1986#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,782 INFO L263 TraceCheckUtils]: 9: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,784 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1986#true} {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #135#return; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {1986#true} assume true; {1986#true} is VALID [2020-07-28 19:14:13,784 INFO L280 TraceCheckUtils]: 5: Hoare triple {1986#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {1986#true} is VALID [2020-07-28 19:14:13,784 INFO L263 TraceCheckUtils]: 4: Hoare triple {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {1986#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {2000#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:13,793 INFO L263 TraceCheckUtils]: 2: Hoare triple {1986#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {1986#true} is VALID [2020-07-28 19:14:13,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {1986#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {1986#true} is VALID [2020-07-28 19:14:13,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {1986#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {1986#true} is VALID [2020-07-28 19:14:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-28 19:14:13,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836677022] [2020-07-28 19:14:13,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:13,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2020-07-28 19:14:13,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97028258] [2020-07-28 19:14:13,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-28 19:14:13,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:13,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:14:13,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:14:13,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:14:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:14:13,885 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 9 states. [2020-07-28 19:14:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:15,359 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2020-07-28 19:14:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:14:15,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-28 19:14:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2020-07-28 19:14:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2020-07-28 19:14:15,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 165 transitions. [2020-07-28 19:14:15,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:15,623 INFO L225 Difference]: With dead ends: 139 [2020-07-28 19:14:15,624 INFO L226 Difference]: Without dead ends: 82 [2020-07-28 19:14:15,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:14:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-28 19:14:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-07-28 19:14:15,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:15,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2020-07-28 19:14:15,673 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-28 19:14:15,673 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-28 19:14:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:15,678 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-07-28 19:14:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-07-28 19:14:15,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:15,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:15,680 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-28 19:14:15,680 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-28 19:14:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:15,685 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-07-28 19:14:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-07-28 19:14:15,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:15,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:15,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:15,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-28 19:14:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2020-07-28 19:14:15,691 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 52 [2020-07-28 19:14:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:15,691 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2020-07-28 19:14:15,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:14:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-07-28 19:14:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-28 19:14:15,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:15,693 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:15,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 19:14:15,908 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1543692906, now seen corresponding path program 1 times [2020-07-28 19:14:15,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:15,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956075666] [2020-07-28 19:14:15,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:16,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 19:14:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:16,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:16,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {2753#true} is VALID [2020-07-28 19:14:16,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {2753#true} is VALID [2020-07-28 19:14:16,201 INFO L263 TraceCheckUtils]: 2: Hoare triple {2753#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {2753#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,202 INFO L263 TraceCheckUtils]: 4: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {2753#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,204 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2753#true} {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #135#return; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,204 INFO L263 TraceCheckUtils]: 9: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,205 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,206 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2753#true} {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #137#return; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,207 INFO L280 TraceCheckUtils]: 13: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:16,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:16,209 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {2753#true} #149#return; {2805#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:16,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {2805#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,210 INFO L263 TraceCheckUtils]: 17: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {2753#true} is VALID [2020-07-28 19:14:16,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,211 INFO L280 TraceCheckUtils]: 19: Hoare triple {2753#true} assume !(~n.base == 0bv32 && ~n.offset == 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, ~bvadd32(4bv32, ~n.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,211 INFO L263 TraceCheckUtils]: 20: Hoare triple {2753#true} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2753#true} is VALID [2020-07-28 19:14:16,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {2753#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2753#true} is VALID [2020-07-28 19:14:16,212 INFO L280 TraceCheckUtils]: 23: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,212 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2753#true} {2753#true} #141#return; {2753#true} is VALID [2020-07-28 19:14:16,213 INFO L280 TraceCheckUtils]: 25: Hoare triple {2753#true} ~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,213 INFO L263 TraceCheckUtils]: 26: Hoare triple {2753#true} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2753#true} is VALID [2020-07-28 19:14:16,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,214 INFO L280 TraceCheckUtils]: 28: Hoare triple {2753#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2753#true} is VALID [2020-07-28 19:14:16,214 INFO L280 TraceCheckUtils]: 29: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,214 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2753#true} {2753#true} #143#return; {2753#true} is VALID [2020-07-28 19:14:16,214 INFO L280 TraceCheckUtils]: 31: Hoare triple {2753#true} ~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2753#true} is VALID [2020-07-28 19:14:16,214 INFO L280 TraceCheckUtils]: 32: Hoare triple {2753#true} assume ~bvsle32(~a~0, ~b~0);#res := ~a~0; {2753#true} is VALID [2020-07-28 19:14:16,215 INFO L280 TraceCheckUtils]: 33: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,216 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2753#true} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #151#return; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,217 INFO L280 TraceCheckUtils]: 35: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,217 INFO L263 TraceCheckUtils]: 36: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {2753#true} is VALID [2020-07-28 19:14:16,217 INFO L280 TraceCheckUtils]: 37: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,218 INFO L280 TraceCheckUtils]: 38: Hoare triple {2753#true} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,218 INFO L263 TraceCheckUtils]: 39: Hoare triple {2753#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2753#true} is VALID [2020-07-28 19:14:16,218 INFO L280 TraceCheckUtils]: 40: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,218 INFO L280 TraceCheckUtils]: 41: Hoare triple {2753#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,219 INFO L280 TraceCheckUtils]: 42: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,219 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2753#true} {2753#true} #145#return; {2753#true} is VALID [2020-07-28 19:14:16,219 INFO L280 TraceCheckUtils]: 44: Hoare triple {2753#true} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,219 INFO L263 TraceCheckUtils]: 45: Hoare triple {2753#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2753#true} is VALID [2020-07-28 19:14:16,220 INFO L280 TraceCheckUtils]: 46: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,220 INFO L280 TraceCheckUtils]: 47: Hoare triple {2753#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,220 INFO L280 TraceCheckUtils]: 48: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,220 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2753#true} {2753#true} #147#return; {2753#true} is VALID [2020-07-28 19:14:16,220 INFO L280 TraceCheckUtils]: 50: Hoare triple {2753#true} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {2753#true} is VALID [2020-07-28 19:14:16,221 INFO L280 TraceCheckUtils]: 51: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,222 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2753#true} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #153#return; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,222 INFO L280 TraceCheckUtils]: 53: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,225 INFO L280 TraceCheckUtils]: 54: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} assume !(0bv32 == assume_abort_if_not_~cond); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,225 INFO L280 TraceCheckUtils]: 55: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,226 INFO L280 TraceCheckUtils]: 56: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,226 INFO L263 TraceCheckUtils]: 57: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {2753#true} is VALID [2020-07-28 19:14:16,227 INFO L280 TraceCheckUtils]: 58: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2936#(= tree_inorder_~t.base |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:14:16,228 INFO L280 TraceCheckUtils]: 59: Hoare triple {2936#(= tree_inorder_~t.base |tree_inorder_#in~t.base|)} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:14:16,228 INFO L280 TraceCheckUtils]: 60: Hoare triple {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} assume true; {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:14:16,230 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #155#return; {2754#false} is VALID [2020-07-28 19:14:16,230 INFO L280 TraceCheckUtils]: 62: Hoare triple {2754#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2754#false} is VALID [2020-07-28 19:14:16,231 INFO L280 TraceCheckUtils]: 63: Hoare triple {2754#false} assume 0bv32 == __VERIFIER_assert_~cond; {2754#false} is VALID [2020-07-28 19:14:16,231 INFO L280 TraceCheckUtils]: 64: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2020-07-28 19:14:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-28 19:14:16,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:16,500 INFO L280 TraceCheckUtils]: 64: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2020-07-28 19:14:16,500 INFO L280 TraceCheckUtils]: 63: Hoare triple {2754#false} assume 0bv32 == __VERIFIER_assert_~cond; {2754#false} is VALID [2020-07-28 19:14:16,500 INFO L280 TraceCheckUtils]: 62: Hoare triple {2754#false} havoc task_#t~ret28;call task_#t~mem29 := read~intINTTYPE4(task_~x~0.base, task_~x~0.offset, 4bv32);__VERIFIER_assert_#in~cond := (if task_~a~1 == task_#t~mem29 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2754#false} is VALID [2020-07-28 19:14:16,505 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #155#return; {2754#false} is VALID [2020-07-28 19:14:16,507 INFO L280 TraceCheckUtils]: 60: Hoare triple {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} assume true; {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:14:16,508 INFO L280 TraceCheckUtils]: 59: Hoare triple {2974#(or (not (= tree_inorder_~t.base (_ bv0 32))) (= (_ bv0 32) |tree_inorder_#in~t.base|))} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := ~i; {2940#(= (_ bv0 32) |tree_inorder_#in~t.base|)} is VALID [2020-07-28 19:14:16,509 INFO L280 TraceCheckUtils]: 58: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2974#(or (not (= tree_inorder_~t.base (_ bv0 32))) (= (_ bv0 32) |tree_inorder_#in~t.base|))} is VALID [2020-07-28 19:14:16,510 INFO L263 TraceCheckUtils]: 57: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret28 := tree_inorder(task_~t.base, task_~t.offset, task_~x~0.base, task_~x~0.offset, task_~n~1); {2753#true} is VALID [2020-07-28 19:14:16,513 INFO L280 TraceCheckUtils]: 56: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~x~0.base, task_~x~0.offset := task_#t~malloc27.base, task_#t~malloc27.offset; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,514 INFO L280 TraceCheckUtils]: 55: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~malloc27.base, task_#t~malloc27.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, task_~n~1));#Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#product := task_#t~malloc27.base, task_#t~malloc27.offset, task_~n~1, 4bv32, ~bvmul32(4bv32, task_~n~1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr.base); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,518 INFO L280 TraceCheckUtils]: 54: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} assume !(0bv32 == assume_abort_if_not_~cond); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,519 INFO L280 TraceCheckUtils]: 53: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~n~1 := task_#t~ret26;havoc task_#t~ret26;assume_abort_if_not_#in~cond := (if 0bv32 != task_~n~1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,521 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2753#true} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #153#return; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,521 INFO L280 TraceCheckUtils]: 51: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,521 INFO L280 TraceCheckUtils]: 50: Hoare triple {2753#true} #res := ~bvadd32(1bv32, ~bvadd32(#t~ret22, #t~ret24));havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret24; {2753#true} is VALID [2020-07-28 19:14:16,521 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2753#true} {2753#true} #147#return; {2753#true} is VALID [2020-07-28 19:14:16,522 INFO L280 TraceCheckUtils]: 48: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,522 INFO L280 TraceCheckUtils]: 47: Hoare triple {2753#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,522 INFO L280 TraceCheckUtils]: 46: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,522 INFO L263 TraceCheckUtils]: 45: Hoare triple {2753#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2753#true} is VALID [2020-07-28 19:14:16,523 INFO L280 TraceCheckUtils]: 44: Hoare triple {2753#true} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, ~bvadd32(8bv32, ~t.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,523 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2753#true} {2753#true} #145#return; {2753#true} is VALID [2020-07-28 19:14:16,523 INFO L280 TraceCheckUtils]: 42: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,524 INFO L280 TraceCheckUtils]: 41: Hoare triple {2753#true} assume ~t.base == 0bv32 && ~t.offset == 0bv32;#res := 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,524 INFO L280 TraceCheckUtils]: 40: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,524 INFO L263 TraceCheckUtils]: 39: Hoare triple {2753#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2753#true} is VALID [2020-07-28 19:14:16,524 INFO L280 TraceCheckUtils]: 38: Hoare triple {2753#true} assume !(~t.base == 0bv32 && ~t.offset == 0bv32);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, ~bvadd32(4bv32, ~t.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,524 INFO L280 TraceCheckUtils]: 37: Hoare triple {2753#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2753#true} is VALID [2020-07-28 19:14:16,525 INFO L263 TraceCheckUtils]: 36: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret26 := size(task_~t.base, task_~t.offset); {2753#true} is VALID [2020-07-28 19:14:16,526 INFO L280 TraceCheckUtils]: 35: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} task_~a~1 := task_#t~ret25;havoc task_#t~ret25;call task_~#b~1.base, task_~#b~1.offset := #Ultimate.allocOnStack(4bv32); {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,527 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2753#true} {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} #151#return; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,527 INFO L280 TraceCheckUtils]: 33: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,527 INFO L280 TraceCheckUtils]: 32: Hoare triple {2753#true} assume ~bvsle32(~a~0, ~b~0);#res := ~a~0; {2753#true} is VALID [2020-07-28 19:14:16,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {2753#true} ~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2753#true} is VALID [2020-07-28 19:14:16,528 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2753#true} {2753#true} #143#return; {2753#true} is VALID [2020-07-28 19:14:16,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,528 INFO L280 TraceCheckUtils]: 28: Hoare triple {2753#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2753#true} is VALID [2020-07-28 19:14:16,529 INFO L280 TraceCheckUtils]: 27: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,529 INFO L263 TraceCheckUtils]: 26: Hoare triple {2753#true} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2753#true} is VALID [2020-07-28 19:14:16,529 INFO L280 TraceCheckUtils]: 25: Hoare triple {2753#true} ~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,529 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2753#true} {2753#true} #141#return; {2753#true} is VALID [2020-07-28 19:14:16,530 INFO L280 TraceCheckUtils]: 23: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,530 INFO L280 TraceCheckUtils]: 22: Hoare triple {2753#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483647bv32; {2753#true} is VALID [2020-07-28 19:14:16,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,530 INFO L263 TraceCheckUtils]: 20: Hoare triple {2753#true} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2753#true} is VALID [2020-07-28 19:14:16,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {2753#true} assume !(~n.base == 0bv32 && ~n.offset == 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, ~bvadd32(4bv32, ~n.offset), 4bv32); {2753#true} is VALID [2020-07-28 19:14:16,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {2753#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2753#true} is VALID [2020-07-28 19:14:16,531 INFO L263 TraceCheckUtils]: 17: Hoare triple {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} call task_#t~ret25 := min(task_~t.base, task_~t.offset); {2753#true} is VALID [2020-07-28 19:14:16,532 INFO L280 TraceCheckUtils]: 16: Hoare triple {2805#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} task_#in~t.base, task_#in~t.offset := main_#t~ret38.base, main_#t~ret38.offset;havoc task_#t~ret25, task_#t~ret26, task_#t~malloc27.base, task_#t~malloc27.offset, task_#t~ret28, task_#t~mem29, task_#t~ret30.base, task_#t~ret30.offset, task_#t~mem31, task_#t~ret32, task_#t~malloc33.base, task_#t~malloc33.offset, task_#t~ret34, task_#t~mem36, task_#t~mem37, task_#t~post35, task_~t.base, task_~t.offset, task_~a~1, task_~#b~1.base, task_~#b~1.offset, task_~n~1, task_~x~0.base, task_~x~0.offset, task_~r~1.base, task_~r~1.offset, task_~m~0, task_~y~0.base, task_~y~0.offset, task_~i~0;task_~t.base, task_~t.offset := task_#in~t.base, task_#in~t.offset; {2809#(not (= (_ bv0 32) ULTIMATE.start_task_~t.base))} is VALID [2020-07-28 19:14:16,537 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {2753#true} #149#return; {2805#(not (= |ULTIMATE.start_main_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:16,539 INFO L280 TraceCheckUtils]: 14: Hoare triple {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:16,539 INFO L280 TraceCheckUtils]: 13: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2798#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:16,540 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2753#true} {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #137#return; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,540 INFO L280 TraceCheckUtils]: 11: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,541 INFO L263 TraceCheckUtils]: 9: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,543 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2753#true} {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #135#return; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-28 19:14:16,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {2753#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {2753#true} is VALID [2020-07-28 19:14:16,544 INFO L263 TraceCheckUtils]: 4: Hoare triple {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,545 INFO L280 TraceCheckUtils]: 3: Hoare triple {2753#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {2767#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:16,545 INFO L263 TraceCheckUtils]: 2: Hoare triple {2753#true} call main_#t~ret38.base, main_#t~ret38.offset := nondet_tree(); {2753#true} is VALID [2020-07-28 19:14:16,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} havoc main_#res;havoc main_#t~ret38.base, main_#t~ret38.offset; {2753#true} is VALID [2020-07-28 19:14:16,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {2753#true} is VALID [2020-07-28 19:14:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-28 19:14:16,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956075666] [2020-07-28 19:14:16,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:16,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2020-07-28 19:14:16,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340320206] [2020-07-28 19:14:16,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-28 19:14:16,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:16,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:14:16,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:16,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:14:16,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:14:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:14:16,647 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 9 states. [2020-07-28 19:14:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:18,205 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2020-07-28 19:14:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:14:18,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-28 19:14:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2020-07-28 19:14:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2020-07-28 19:14:18,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 157 transitions. [2020-07-28 19:14:18,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:18,471 INFO L225 Difference]: With dead ends: 134 [2020-07-28 19:14:18,471 INFO L226 Difference]: Without dead ends: 84 [2020-07-28 19:14:18,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:14:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-28 19:14:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-07-28 19:14:18,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:18,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2020-07-28 19:14:18,507 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2020-07-28 19:14:18,507 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2020-07-28 19:14:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:18,513 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2020-07-28 19:14:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2020-07-28 19:14:18,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:18,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:18,514 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2020-07-28 19:14:18,514 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2020-07-28 19:14:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:18,519 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2020-07-28 19:14:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2020-07-28 19:14:18,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:18,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:18,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:18,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-28 19:14:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2020-07-28 19:14:18,526 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 65 [2020-07-28 19:14:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:18,526 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2020-07-28 19:14:18,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:14:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2020-07-28 19:14:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-28 19:14:18,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:18,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:18,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 19:14:18,744 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:18,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1767582969, now seen corresponding path program 1 times [2020-07-28 19:14:18,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:18,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441243393] [2020-07-28 19:14:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:18,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:18,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:19,081 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 19:14:19,081 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:14:19,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 19:14:19,317 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,318 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,321 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,321 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,331 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,331 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,331 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,332 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,332 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,332 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,333 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,333 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-07-28 19:14:19,349 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret38 := nondet_tree(); [2020-07-28 19:14:19,350 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:216) 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:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:14:19,361 INFO L168 Benchmark]: Toolchain (without parser) took 13850.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:19,363 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:14:19,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:19,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:14:19,365 INFO L168 Benchmark]: Boogie Preprocessor took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:19,368 INFO L168 Benchmark]: RCFGBuilder took 892.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:19,369 INFO L168 Benchmark]: TraceAbstraction took 12380.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.9 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:19,376 INFO L336 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 892.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12380.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -54.9 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...